Stiebitz, Michael;
Toft, Bjarne
Brooks's theorem. - In: Topics in chromatic graph theory, (2015), S. 36-55
Brooks's theorem. - In: Topics in chromatic graph theory, (2015), S. 36-55
Stiebitz, Michael;
Tuza, Zsolt; Voigt, Margit
Orientations of graphs with prescribed weighted out-degrees. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 31 (2015), 1, S. 265-280
https://doi.org/10.1007/s00373-013-1382-0
Orientations of graphs with prescribed weighted out-degrees. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 31 (2015), 1, S. 265-280
https://doi.org/10.1007/s00373-013-1382-0
Sukjit, Panchalee; Kubek, Mario; Böhme, Thomas; Unger, Herwig
PDSearch: using pictures as queries. - In: Recent advances in information and communication technology, (2014), S. 255-262
http://dx.doi.org/10.1007/978-3-319-06538-0_25
PDSearch: using pictures as queries. - In: Recent advances in information and communication technology, (2014), S. 255-262
http://dx.doi.org/10.1007/978-3-319-06538-0_25
Girlich, Franz; Roßberg, Michael; Schäfer, Günter; Böhme, Thomas; Schreyer, Jens
Bounds for the security of the Vivaldi network coordinate system. - In: 2013 Conference on Networked Systems (NetSys), ISBN 978-1-4673-5645-9, (2013), S. 66-75
http://dx.doi.org/10.1109/NetSys.2013.21
Bounds for the security of the Vivaldi network coordinate system. - In: 2013 Conference on Networked Systems (NetSys), ISBN 978-1-4673-5645-9, (2013), S. 66-75
http://dx.doi.org/10.1109/NetSys.2013.21
Fleischner, Herbert; Stiebitz, Michael
Some remarks on the cycle plus triangles problem. - In: The mathematics of Paul Erdös, (2013), S. 119-125
Some remarks on the cycle plus triangles problem. - In: The mathematics of Paul Erdös, (2013), S. 119-125
Scheide, Diego;
Stiebitz, Michael
The maximum chromatic index of multigraphs with given Δ and μ. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 28 (2012), 5, S. 717-722
https://doi.org/10.1007/s00373-011-1068-4
The maximum chromatic index of multigraphs with given Δ and μ. - In: Graphs and combinatorics, ISSN 1435-5914, Bd. 28 (2012), 5, S. 717-722
https://doi.org/10.1007/s00373-011-1068-4
Kostochka, Alexandr V.; Rabern, Landon; Stiebitz, Michael
Graphs with chromatic number close to maximum degree. - In: Discrete mathematics, Bd. 312 (2012), 6, S. 1273-1281
http://dx.doi.org/10.1016/j.disc.2011.12.014
Graphs with chromatic number close to maximum degree. - In: Discrete mathematics, Bd. 312 (2012), 6, S. 1273-1281
http://dx.doi.org/10.1016/j.disc.2011.12.014
Stiebitz, Michael; Scheide, Diego; Toft, Bjarne; Favrholdt, Lene M.
Graph edge coloring : Vizing's theorem and Goldberg's conjecture. - Hoboken, NJ : Wiley, 2012. - XIV, 321 S.. - (Wiley series in discrete mathematics and optimization) ISBN 1-118-09137-X
"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
Graph edge coloring : Vizing's theorem and Goldberg's conjecture. - Hoboken, NJ : Wiley, 2012. - XIV, 321 S.. - (Wiley series in discrete mathematics and optimization) ISBN 1-118-09137-X
"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"--
Böhme, Thomas; Schreyer, Jens; Škrabul'áková, Erika
A note on semi-steady states in stochastic cellular automata. - In: Autonomous systems: developments and trends, (2011), S. 313-323
A note on semi-steady states in stochastic cellular automata. - In: Autonomous systems: developments and trends, (2011), S. 313-323
Böhme, Thomas;
Kostochka, Alexander; Thomason, Andrew
Minors in graphs with high chromatic number. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 20 (2011), 4, S. 513-518
https://doi.org/10.1017/S0963548311000174
Minors in graphs with high chromatic number. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 20 (2011), 4, S. 513-518
https://doi.org/10.1017/S0963548311000174