Draque Penso, Lucia;
Rautenbach, Dieter; Rautenbach, Dieter *1972-*; Szwarcfiter, Jayme Luiz
Connectivity and diameter in distance graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 17 S., 177 KB). - (Preprint ; M09,12)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12976
Connectivity and diameter in distance graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 17 S., 177 KB). - (Preprint ; M09,12)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12976
Draque Penso, Lucia;
Rautenbach, Dieter; Rautenbach, Dieter *1972-*; Szwarcfiter, Jayme Luiz
Long cycles and paths in distance graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 12 S., 242 KB). - (Preprint ; M09,11)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12973
Long cycles and paths in distance graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 12 S., 242 KB). - (Preprint ; M09,11)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12973
Lin, Min Chih; Rautenbach, Dieter; Soulignac, Francisco Juan; Szwarcfiter, Jayme Luiz
Powers of cycles, powers of paths, and distance graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 13 S., 183,6 KB). - (Preprint ; M09,10)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12969
Powers of cycles, powers of paths, and distance graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 13 S., 183,6 KB). - (Preprint ; M09,10)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12969
Löwenstein, Christian; Rautenbach, Dieter;
Pairs of disjoint dominating sets and the minimum degree of graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 19 S., 193,5 KB). - (Preprint ; M09,09)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12978
Pairs of disjoint dominating sets and the minimum degree of graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 19 S., 193,5 KB). - (Preprint ; M09,09)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12978
Rautenbach, Dieter;
Regen, Friedrich;
Graphs with many vertex-disjoint cycles. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 10 S., 156,4 KB). - (Preprint ; M09,08)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12963
Graphs with many vertex-disjoint cycles. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 10 S., 156,4 KB). - (Preprint ; M09,08)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12963
Rautenbach, Dieter;
Regen, Friedrich;
On packing shortest cycles in graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 9 S., 183,6 KB). - (Preprint ; M09,07)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12960
On packing shortest cycles in graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 9 S., 183,6 KB). - (Preprint ; M09,07)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12960
Hopfe, Norman;
Ilchmann, Achim; Ilchmann, Achim *1956-*; Ryan, Eugene P.
Funnel control with saturation: linear MIMO systems. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 15 S., 189,7 KB). - (Preprint ; M09,05)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12958
Funnel control with saturation: linear MIMO systems. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2009. - Online-Ressource (PDF-Datei: 15 S., 189,7 KB). - (Preprint ; M09,05)
http://www.db-thueringen.de/servlets/DocumentServlet?id=12958
Rautenbach, Dieter; Volkmann, Lutz
On the existence of edge cuts leaving several large components. - In: Discrete mathematics, Bd. 309 (2009), 6, S. 1703-1707
http://dx.doi.org/10.1016/j.disc.2008.02.014
On the existence of edge cuts leaving several large components. - In: Discrete mathematics, Bd. 309 (2009), 6, S. 1703-1707
http://dx.doi.org/10.1016/j.disc.2008.02.014
Böhme, Thomas; Kostochka, Alexandr
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. - In: Discrete mathematics, Bd. 309 (2009), 4, S. 997-1000
http://dx.doi.org/10.1016/j.disc.2008.01.010
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. - In: Discrete mathematics, Bd. 309 (2009), 4, S. 997-1000
http://dx.doi.org/10.1016/j.disc.2008.01.010
Meer, Klaus; Rautenbach, Dieter
On the OBDD size for graphs of bounded tree- and clique-width. - In: Discrete mathematics, Bd. 309 (2009), 4, S. 843-851
http://dx.doi.org/10.1016/j.disc.2008.01.022
On the OBDD size for graphs of bounded tree- and clique-width. - In: Discrete mathematics, Bd. 309 (2009), 4, S. 843-851
http://dx.doi.org/10.1016/j.disc.2008.01.022