Publications at the Institute of Mathematics

Results: 2091
Created on: Fri, 05 Jul 2024 23:16:06 +0200 in 0.0981 sec


Rautenbach, Dieter; Volkmann, Lutz;
On the existence of edge cuts leaving several large components. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 8 S. = 171,8 KB, Text. - (Preprint ; M07,10)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9397
Löwenstein, Christian; Rautenbach, Dieter;
Domination in graphs of minimum degree at least two and large girth. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 10 S. = 164,4 KB, Text. - (Preprint ; M07,09)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9374
Harant, Jochen; Rautenbach, Dieter;
Domination in bipartite graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - Online-Ressource (13 S. = 261,7 KB, Text). - (Preprint ; M07,08)Literaturverz. S. 12 - 13

http://www.db-thueringen.de/servlets/DocumentServlet?id=9373
Rautenbach, Dieter; Reed, Bruce
Domination in cubic graphs of large girth. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 6 S. = 133,9 KB, Text. - (Preprint ; M07,07)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9353
Rautenbach, Dieter; Volkmann, Lutz;
Cyclic sums, network sharing and restricted edge cuts in graphs with long cycles. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 9 S. = 165,8 KB, Text. - (Preprint ; M07,06)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9352
Göring, Frank; Harant, Jochen; Rautenbach, Dieter; Schiermeyer, Ingo
On F-independence in graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 7 S. = 145,8 KB. - (Preprint ; M07,05)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9351
John, Peter E.; Sachs, Horst;
Spectra of toroidal graphs. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 44 S. = 811 KB. - (Preprint ; M07,04)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9350
Brandt, Stephan; Rautenbach, Dieter; Rautenbach, Dieter *1972-*; Stiebitz, Michael;
Edge colouring by total labellings. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2007. - 13 S. = 181,5 KB, Text. - (Preprint ; M07,03)
http://www.db-thueringen.de/servlets/DocumentServlet?id=9347
Ilchmann, Achim; Mueller, Markus
Time-varying linear systems: relative degree and normal form. - In: IEEE transactions on automatic control, ISSN 1558-2523, Bd. 52 (2007), 5, S. 840-851

http://dx.doi.org/10.1109/TAC.2007.895843
Schreyer, Jens; Walther, Hansjoachim; Mel'nikov, Leonid S.
Vertex-oblique graphs. - In: Discrete mathematics, Bd. 307 (2007), 11/12, S. 1538-1544

Let x be a vertex of a simple graph G. The vertex-type of x is the lexicographically ordered degree sequence of its neighbors. We call the graph G vertex-oblique if there are no two vertices in V(G) which are of the same vertex-type. We will show that the set of vertex-oblique graphs of arbitrary connectivity is infinite.



http://dx.doi.org/10.1016/j.disc.2005.11.091