Veröffentlichungen im Fachgebiet
Anzahl der Treffer: 88
Erstellt: Wed, 27 Mar 2024 23:22:30 +0100 in 0.0700 sec


Harant, Jochen; Hornak, Mirko; Skupien, Zdzislaw
Separating 3-cycles in plane triangulations. - In: Discrete mathematics, Bd. 239 (2001), 1/3, S. 127-136

http://dx.doi.org/10.1016/S0012-365X(01)00047-4
Göring, Frank;
Short proof of Menger's theorem. - In: Discrete mathematics, Bd. 219 (2000), 1/3, S. 295-296

http://dx.doi.org/10.1016/S0012-365X(00)00088-1
Harant, Jochen;
Some news about the independence number of a graph. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 20 (2000), 1, S. 71-79

https://doi.org/10.7151/dmgt.1107
Harant, Jochen; Hor&hacek;nák, Mirko
Cycles and colourings '97 : proceedings of the 6rd Workshop on Cycles and Colourings, Stará Lesná, September 7 - 12, 1997. - Bratislava : Mathematical Institute, Slovak Academy of Sciences, 1999. - 113 S.. - (Tatra mountains mathematical publications ; 18)
Harant, Jochen; Jendrol', Stanislav; Tkáč, Michal
On 3-connected plane graphs without triangular faces. - In: Journal of combinatorial theory, Bd. 77 (1999), 1, S. 150-161

http://dx.doi.org/10.1006/jctb.1999.1918
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
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
Harant, Jochen; Pruchnewski, Anja; Voigt, Margit
On dominating sets and independent sets of graphs. - In: Combinatorics, probability & computing, ISSN 1469-2163, Bd. 8 (1999), 6, S. 547-553

https://doi.org/10.1017/S0963548399004034
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
Harant, Jochen;
A lower bound on the independence number of a graph. - In: Discrete mathematics, Bd. 188 (1998), 1/3, S. 239-243

http://dx.doi.org/10.1016/S0012-365X(98)00048-X