http://www.tu-ilmenau.de

Logo TU Ilmenau


Arbeitsgruppe
Diskrete Mathematik und Algebra


Ansprechpartner

Univ.-Prof. Dr. rer. nat. habil. Matthias Kriesell

Fachgebietsleiter

Telefon +49 3677 69-3633

E-Mail senden


Ihre Position

INHALTE

Publikationsliste seit 1990

Anzahl der Treffer: 361
Erstellt: Wed, 18 Oct 2017 23:03:30 +0200 in 0.0390 sec


Göring, Frank; Harant, Jochen
Prescribed edges and forbidden edges for a cycle in a planar graph. - In: Discrete applied mathematics. - [S.l.] : Elsevier, Bd. 161 (2013), 12, S. 1734-1738
http://dx.doi.org/10.1016/j.dam.2011.08.020
Scheide, Diego; Stiebitz, Michael
The maximum chromatic index of multigraphs with given [Delta] and [mu]. - In: Graphs and combinatorics. - Tokyo : Springer-Verl. Tokyo, ISSN 14355914, Bd. 28 (2012), 5, S. 717-722
http://dx.doi.org/10.1007/s00373-011-1068-4
Cranston, Daniel W.; Pruchnewski, Anja; Tuza, Zsolt; Voigt, Margit
List colorings of K5-minor-free graphs with special list assignments. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 10970118, Bd. 71 (2012), 1/2, S. 18-30
http://dx.doi.org/10.1002/jgt.20628
Borowiecki, Piotr; Göring, Frank; Harant, Jochen; Rautenbach, Dieter
The potential of greed for independence. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 10970118, Bd. 71 (2012), 3/4, S. 245-259
http://dx.doi.org/10.1002/jgt.20644
Pruchnewski, Anja; Voigt, Margit
Weights of induced subgraphs in K1,r-free graphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 312 (2012), 16, S. 2429-2432
http://dx.doi.org/10.1016/j.disc.2012.04.025
Harant, Jochen; Kemnitz, Arnfried; Saito, Akira; Schiermeyer, Ingo
Closures, cycles, and paths. - In: Journal of graph theory. - New York, NY [u.a.] : Wiley, ISSN 10970118, Bd. 69 (2012), 3, S. 314-323
http://dx.doi.org/10.1002/jgt.20584
Schreyer, Jens; Škrabul'áková, Erika
On the facial Thue choice index of plane graphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 312 (2012), 10, S. 1713-1721
http://dx.doi.org/10.1016/j.disc.2012.01.023
Kostochka, Alexandr V.; Rabern, Landon; Stiebitz, Michael
Graphs with chromatic number close to maximum degree. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 312 (2012), 6, S. 1273-1281
http://dx.doi.org/10.1016/j.disc.2011.12.014
Harant, Jochen; Jendrol', Stanislav
Nonrepetitive vertex colorings of graphs. - In: Discrete mathematics. - Amsterdam [u.a.] : Elsevier, Bd. 312 (2012), 2, S. 374-380
http://dx.doi.org/10.1016/j.disc.2011.09.027
Stiebitz, Michael; Scheide, Diego; Toft, Bjarne; Favrholdt, Lene M.
Graph edge coloring : Vizing's theorem and Goldberg's conjecture. - Hoboken, NJ : Wiley. - XIV, 321 S.. - (Wiley series in discrete mathematics and optimization)
ISBN 111809137X = 978-1-118-09137-1
"Written by world authorities on graph theory, this book features many new advances and applications in graph edge coloring, describes how the results are interconnected, and provides historial context throughout. Chapter coverage includes an introduction to coloring preliminaries and lower and upper bounds; the Vizing fan; the Kierstead path; simple graphs and line graphs of multigraphs; the Tashkinov tree; Goldberg's conjecture; extreme graphs; generalized edge coloring; and open problems. It serves as a reference for researchers interested in discrete mathematics, graph theory, operations research, theoretical computer science, and combinatorial optimization, as well as a graduate-level course book for students of mathematics, optimization, and computer science"-- Provided by publisher

"This book provides an overview of this development as well as describes how the many different results are related"--


http://www.gbv.de/dms/ilmenau/toc/670551414.PDF