Veröffentlichungen im Fachgebiet
Anzahl der Treffer: 88
Erstellt: Thu, 25 Apr 2024 23:11:38 +0200 in 0.0683 sec


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
Harant, Jochen
Cycles and colourings '94 : proceedings of the 3rd Workshop on Cycles and Colourings, Stará Lesná, September 4 - 9, 1994. - Bratislava : Mathematical Institute, Slovak Academy of Sciences, 1996. - 104 S.. - (Tatra mountains mathematical publications ; 9)
Böhme, Thomas; Harant, Jochen; Harant, Jochen *1954-*; Tkác, Michal
On the minimal number of separating 3-cycles in non-Hamiltonian maximal planar graphs. - In: Cycles and colourings '94, (1996), S. 97-102

Harant, Jochen; Owens, Peter J.; Tkác, Michal; Walther, Hansjoachim
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. - In: Discrete mathematics, Bd. 150 (1996), 1/3, S. 143-153

http://dx.doi.org/10.1016/0012-365X(95)00183-W
Harant, Jochen; Owens, Peter J.
Non-hamiltonian 5/4-tough maximal planar graphs. - In: Discrete mathematics, Bd. 147 (1995), 1/3, S. 301-305

http://dx.doi.org/doi:10.1016/0012-365X(94)00177-K
Harant, Jochen; Walther, Hansjoachim;
A lower bound for the shortness coefficient of a class of graphs. - In: Discrete applied mathematics, ISSN 1872-6771, Bd. 51 (1994), 1/2, S. 103-105

https://doi.org/10.1016/0166-218X(94)90098-1
Harant, Jochen;
An upper bound for the radius of a 3-connected graph. - In: Discrete mathematics, Bd. 122 (1993), 1/3, S. 335-341

http://dx.doi.org/10.1016/0012-365X(93)90306-E
Harant, Jochen;
Toughness and nonhamiltonicity of polyhedral graphs. - In: Discrete mathematics, Bd. 113 (1993), 1/3, S. 249-253

http://dx.doi.org/10.1016/0012-365X(93)90519-Y