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
John, Peter E.; Mallion, Roger B.; Gutman, Ivan
An algorithm for counting spanning trees in labeled molecular graphs homeomorphic to cata-condensed systems. - In: Journal of chemical information and modeling, ISSN 1549-960X, Bd. 38 (1998), 2, S. 108-112
Abstract published in Advance ACS Abstracts, December 15, 1997
https://doi.org/10.1021/ci970425d
An algorithm for counting spanning trees in labeled molecular graphs homeomorphic to cata-condensed systems. - In: Journal of chemical information and modeling, ISSN 1549-960X, Bd. 38 (1998), 2, S. 108-112
Abstract published in Advance ACS Abstracts, December 15, 1997
https://doi.org/10.1021/ci970425d
John, Peter E.;
Kekulé count in toroidal hexagonal carbon cages. - In: Croatica chemica acta, ISSN 0011-1643, Bd. 71 (1998), 3, S. 435-447
Kekulé count in toroidal hexagonal carbon cages. - In: Croatica chemica acta, ISSN 0011-1643, Bd. 71 (1998), 3, S. 435-447
Mihók, Peter; Bucko, Jozef; Voigt, Margit
On uniquely partitionable planar graphs. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 149-158
http://dx.doi.org/10.1016/S0012-365X(98)00102-2
On uniquely partitionable planar graphs. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 149-158
http://dx.doi.org/10.1016/S0012-365X(98)00102-2
Kratochvíl, Jan;
Tuza, Zsolt; Voigt, Margit
Complexity of choosing subsets from color sets. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 139-148
http://dx.doi.org/10.1016/S0012-365X(98)00101-0
Complexity of choosing subsets from color sets. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 139-148
http://dx.doi.org/10.1016/S0012-365X(98)00101-0
Kostochka, Alexandr V.; Stiebitz, Michael
Colour-critical graphs with few edges. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 125-137
http://dx.doi.org/10.1016/S0012-365X(98)00100-9
Colour-critical graphs with few edges. - In: Discrete mathematics, Bd. 191 (1998), 1/3, S. 125-137
http://dx.doi.org/10.1016/S0012-365X(98)00100-9
Kratochvíl, Jan;
Tuza, Zsolt; Voigt, Margit
Brooks-type theorems for choosability with separation. - In: Journal of graph theory, ISSN 1097-0118, Bd. 27 (1998), 1, S. 43-49
https://doi.org/10.1002/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.0.CO;2-G
Brooks-type theorems for choosability with separation. - In: Journal of graph theory, ISSN 1097-0118, Bd. 27 (1998), 1, S. 43-49
https://doi.org/10.1002/(SICI)1097-0118(199801)27:1<43::AID-JGT7>3.0.CO;2-G
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
Voigt, Margit;
On list colourings and choosability of graphs. - 130 Bl Ilmenau : Techn. Univ., Habil.-Schr., 1998
On list colourings and choosability of graphs. - 130 Bl Ilmenau : Techn. Univ., Habil.-Schr., 1998