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
Böhme, Thomas; Kostochka, Alexandr; Thomason, Andrew
Hadwiger numbers and over-dominating colourings. - In: Discrete mathematics, Bd. 310 (2010), 20, S. 2662-2665
http://dx.doi.org/10.1016/j.disc.2010.03.024
Hadwiger numbers and over-dominating colourings. - In: Discrete mathematics, Bd. 310 (2010), 20, S. 2662-2665
http://dx.doi.org/10.1016/j.disc.2010.03.024
Girlich, Franz; Roßberg, Michael; Schäfer, Günter; Böhme, Thomas; Schreyer, Jens
Scrubbing the Vivaldi network coordinate system. - In: Crossing borders within the ABC, (2010), S. 754-760
http://www.db-thueringen.de/servlets/DocumentServlet?id=17361
Scrubbing the Vivaldi network coordinate system. - In: Crossing borders within the ABC, (2010), S. 754-760
http://www.db-thueringen.de/servlets/DocumentServlet?id=17361
Böhme, Thomas;
Schreyer, Jens;
A game theoretic approach to graph problems. - In: 9th International Conference on Innovative Internet Community Systems, I2CS 2009, (2009), S. 149-156
A game theoretic approach to graph problems. - In: 9th International Conference on Innovative Internet Community Systems, I2CS 2009, (2009), S. 149-156
Böhme, Thomas; Göring, Frank; Tuza, Zsolt; Unger, Herwig
Learning of winning strategies for terminal games with linear-size memory. - In: International journal of game theory, ISSN 1432-1270, Bd. 38 (2009), 2, S. 155-168
http://dx.doi.org/10.1007/s00182-008-0142-5
Learning of winning strategies for terminal games with linear-size memory. - In: International journal of game theory, ISSN 1432-1270, Bd. 38 (2009), 2, S. 155-168
http://dx.doi.org/10.1007/s00182-008-0142-5
Böhme, Thomas; Kawarabayashi, Ken-ichi; Maharry, John; Mohar, Bojan
Linear connectivity forces large complete bipartite minors. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 99 (2009), 3, S. 557-582
http://dx.doi.org/10.1016/j.jctb.2008.07.006
Linear connectivity forces large complete bipartite minors. - In: Journal of combinatorial theory. . - Orlando, Fla. : Academic Press, 1971- , ZDB-ID: 1469158-9, Bd. 99 (2009), 3, S. 557-582
http://dx.doi.org/10.1016/j.jctb.2008.07.006
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
Böhme, Thomas;
Gerlach, Tobias; Stiebitz, Michael;
Ordered and linked chordal graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 28 (2008), 2, S. 367-373
https://doi.org/10.7151/dmgt.1412
Ordered and linked chordal graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 28 (2008), 2, S. 367-373
https://doi.org/10.7151/dmgt.1412
Böhme, Thomas; Knor, Martin; Niepel, L'udovít
Linkability in iterated line graphs. - In: Discrete mathematics, Bd. 306 (2006), 7, S. 666-669
http://dx.doi.org/10.1016/j.disc.2005.11.018
Linkability in iterated line graphs. - In: Discrete mathematics, Bd. 306 (2006), 7, S. 666-669
http://dx.doi.org/10.1016/j.disc.2005.11.018
Böhme, Thomas
Innovative internet community systems : 4th international workshop, IICS 2004, Guadalajara, Mexico, June 21 - 23, 2004 ; revised papers. - Berlin : Springer, 2006. - XI, 306 S.. - (Lecture notes in computer science ; 3473) ISBN 3-540-28880-5
Literaturangaben
Innovative internet community systems : 4th international workshop, IICS 2004, Guadalajara, Mexico, June 21 - 23, 2004 ; revised papers. - Berlin : Springer, 2006. - XI, 306 S.. - (Lecture notes in computer science ; 3473) ISBN 3-540-28880-5
Literaturangaben