Böhme, Thomas;
Göring, Frank; Harant, Jochen;
Menger's theorem. - In: Journal of graph theory, ISSN 1097-0118, Bd. 37 (2001), 1, S. 35-36
https://doi.org/10.1002/jgt.1001
Menger's theorem. - In: Journal of graph theory, ISSN 1097-0118, Bd. 37 (2001), 1, S. 35-36
https://doi.org/10.1002/jgt.1001
Unger, Herwig; Wulff, Markus; Böhme, Thomas
Community-based information management : an empiric approach. - In: Rostocker Informatik-Berichte, ISSN 0233-0784, (2001), 26, S. 89-107
Community-based information management : an empiric approach. - In: Rostocker Informatik-Berichte, ISSN 0233-0784, (2001), 26, S. 89-107
Böhme, Thomas;
Mohar, Bojan
Domination, packing and excluded minors. - Ljubljana : Institute of Mathematics, Physics and Mechanics, Department of Mathematics, University of Ljubljana, 2001. - 6 Seiten. - (Preprint series ; 39,734)Literaturverzeichnis: Seite 6
Domination, packing and excluded minors. - Ljubljana : Institute of Mathematics, Physics and Mechanics, Department of Mathematics, University of Ljubljana, 2001. - 6 Seiten. - (Preprint series ; 39,734)Literaturverzeichnis: Seite 6
Nützel, Jürgen;
Fengler, Wolfgang; Böhme, Thomas
Objektorientierter Entwurf verteilter eingebetteter Echtzeitsysteme auf Basis höherer Petri-Netze. - In: Entwicklung und Betrieb komplexer Automatisierungssysteme, (1999), S. 151-170
Objektorientierter Entwurf verteilter eingebetteter Echtzeitsysteme auf Basis höherer Petri-Netze. - In: Entwicklung und Betrieb komplexer Automatisierungssysteme, (1999), S. 151-170
Böhme, Thomas;
Mohar, Bojan; Stiebitz, Michael;
Dirac's map-color theorem for choosability. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 4, S. 327-339
https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-B
Dirac's map-color theorem for choosability. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 4, S. 327-339
https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-B
Böhme, Thomas;
Harant, Jochen; Harant, Jochen *1954-*; Tkáč, Michal
More than one tough chordal planar graphs are Hamiltonian. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 4, S. 405-410
https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<405::AID-JGT8>3.0.CO;2-Z
More than one tough chordal planar graphs are Hamiltonian. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 4, S. 405-410
https://doi.org/10.1002/(SICI)1097-0118(199912)32:4<405::AID-JGT8>3.0.CO;2-Z
Böhme, Thomas;
Harant, Jochen; Harant, Jochen *1954-*; Tkáč, Michal
On certain Hamiltonian cycles in planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 1, S. 81-96
https://doi.org/10.1002/(SICI)1097-0118(199909)32:1<81::AID-JGT8>3.0.CO;2-9
On certain Hamiltonian cycles in planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 32 (1999), 1, S. 81-96
https://doi.org/10.1002/(SICI)1097-0118(199909)32:1<81::AID-JGT8>3.0.CO;2-9
Böhme, Thomas;
Über Kreise in eingebetteten Graphen. - 96 Bl. Ilmenau : Techn. Univ., Habil.-Schr., 1999
Über Kreise in eingebetteten Graphen. - 96 Bl. Ilmenau : Techn. Univ., Habil.-Schr., 1999
Böhme, Thomas; Harant, Jochen
On Hamiltonian cycles in 4- and 5-connected plane triangulations. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 25-30
http://dx.doi.org/10.1016/S0012-365X(98)00089-2
On Hamiltonian cycles in 4- and 5-connected plane triangulations. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 25-30
http://dx.doi.org/10.1016/S0012-365X(98)00089-2
Böhme, Thomas; Harant, Jochen; Pruchnewski, Anja; Schiermeyer, Ingo
A planarity criterion bipartite graphs. - In: Discrete mathematics, Bd. 191 (1998), 1, S. 31-43
http://dx.doi.org/10.1016/S0012-365X(98)00090-9
A planarity criterion bipartite graphs. - In: Discrete mathematics, Bd. 191 (1998), 1, S. 31-43
http://dx.doi.org/10.1016/S0012-365X(98)00090-9