Tuza, Zsolt;
Voigt, Margit
Every 2-choosable graph is (2m, m)-choosable. - In: Journal of graph theory, ISSN 1097-0118, Bd. 22 (1996), 3, S. 245-252
https://doi.org/10.1002/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M
Every 2-choosable graph is (2m, m)-choosable. - In: Journal of graph theory, ISSN 1097-0118, Bd. 22 (1996), 3, S. 245-252
https://doi.org/10.1002/(SICI)1097-0118(199607)22:3<245::AID-JGT5>3.0.CO;2-M
Böhme, Thomas;
Broersma, H. J.; Veldman, H. J.
Toughness and longest cycles in 2-connected planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 23 (1996), 3, S. 257-263
https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R
Toughness and longest cycles in 2-connected planar graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 23 (1996), 3, S. 257-263
https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<257::AID-JGT5>3.0.CO;2-R
Stiebitz, Michael;
Decomposing graphs under degree constraints. - In: Journal of graph theory, ISSN 1097-0118, Bd. 23 (1996), 3, S. 321-324
https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H
Decomposing graphs under degree constraints. - In: Journal of graph theory, ISSN 1097-0118, Bd. 23 (1996), 3, S. 321-324
https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H
John, Peter E.; Schild, Göran
Calculating the characteristic polynomial and the eigenvectors of a tree. - In: Match, ISSN 0340-6253, Bd. 34 (1996), S. 217-237
Calculating the characteristic polynomial and the eigenvectors of a tree. - In: Match, ISSN 0340-6253, Bd. 34 (1996), S. 217-237
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
On the minimal number of separating 3-cycles in non-Hamiltonian maximal planar graphs. - In: Cycles and colourings '94, (1996), S. 97-102
Owens, Peter J.; Walther, Hansjoachim;
Hamiltonicity in multitriangular graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 15 (1995), 1, S. 77-88
https://doi.org/10.7151/dmgt.1009
Hamiltonicity in multitriangular graphs. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 15 (1995), 1, S. 77-88
https://doi.org/10.7151/dmgt.1009
John, Peter E.; Rausch, Wilfried
Beschreibung eines Programms zur Berechnung des charakteristischen Polynoms und der Eigenvektoren eines Graphen. - In: Match, ISSN 0340-6253, Bd. 32 (1995), S. 237-249
Beschreibung eines Programms zur Berechnung des charakteristischen Polynoms und der Eigenvektoren eines Graphen. - In: Match, ISSN 0340-6253, Bd. 32 (1995), S. 237-249
John, Peter E.;
Über die Berechnung des Wiener-Index für ausgewählte [delta]-dimensionale Gitterstrukturen. - In: Match, ISSN 0340-6253, Bd. 32 (1995), S. 207-219
Über die Berechnung des Wiener-Index für ausgewählte [delta]-dimensionale Gitterstrukturen. - In: Match, ISSN 0340-6253, Bd. 32 (1995), S. 207-219
Stiebitz, Michael;
The forest plus stars colouring problem. - In: Discrete mathematics, Bd. 126 (1994), 1/3, S. 385-389
http://dx.doi.org/10.1016/0012-365X(94)90282-8
The forest plus stars colouring problem. - In: Discrete mathematics, Bd. 126 (1994), 1/3, S. 385-389
http://dx.doi.org/10.1016/0012-365X(94)90282-8
John, Peter E.;
ChemInform abstract: Calculating the cell polynomial of catacondensed polycyclic hydrocarbons. - In: ChemInform, ISSN 1522-2667, Bd. 25 (1994), 30, insges. 1 S.
http://dx.doi.org/10.1002/chin.199430257
ChemInform abstract: Calculating the cell polynomial of catacondensed polycyclic hydrocarbons. - In: ChemInform, ISSN 1522-2667, Bd. 25 (1994), 30, insges. 1 S.
http://dx.doi.org/10.1002/chin.199430257