Brandt, Stephan;
On the structure of graphs with bounded clique number. - In: Combinatorica, ISSN 1439-6912, Bd. 23 (2003), 4, S. 693-696
http://dx.doi.org/10.1007/s00493-003-0042-z
On the structure of graphs with bounded clique number. - In: Combinatorica, ISSN 1439-6912, Bd. 23 (2003), 4, S. 693-696
http://dx.doi.org/10.1007/s00493-003-0042-z
Stiebitz, Michael; Škrekovski, Riste
A map colour theorem for the union of graphs. - Praha : Charles Univ., 2003. - 23 S. - (KAM-DIMATIA series ; 634)
A map colour theorem for the union of graphs. - Praha : Charles Univ., 2003. - 23 S. - (KAM-DIMATIA series ; 634)
John, Peter E.; Ortlepp, Thomas
Note on cospectral graphs with simple eigenvalues. - In: Match, ISSN 0340-6253, Bd. 48 (2003), S. 49-53
Note on cospectral graphs with simple eigenvalues. - In: Match, ISSN 0340-6253, Bd. 48 (2003), S. 49-53
Böhme, Thomas; Heyer, Gerhard; Unger, Herwig
Innovative internet community systems : third international workshop ; revised papers. - Berlin : Springer, 2003. - VIII, 262 S.. - (Lecture notes in computer science ; 2877) ISBN 3-540-20436-9
Includes bibliographical references and index
Innovative internet community systems : third international workshop ; revised papers. - Berlin : Springer, 2003. - VIII, 262 S.. - (Lecture notes in computer science ; 2877) ISBN 3-540-20436-9
Includes bibliographical references and index
Kratochvíl, Jan;
Tuza, Zsolt; Voigt, Margit
On the b-chromatic number of graphs. - In: Graph-Theoretic Concepts in Computer Science, (2002), S. 310-320
https://doi.org/10.1007/3-540-36379-3_27
On the b-chromatic number of graphs. - In: Graph-Theoretic Concepts in Computer Science, (2002), S. 310-320
https://doi.org/10.1007/3-540-36379-3_27
Fowler, Patrick W.;
John, Peter E.;
Dürer polyhedra: the dark side of Melancholia. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 101-109
https://doi.org/10.7151/dmgt.1160
Dürer polyhedra: the dark side of Melancholia. - In: Discussiones mathematicae, ISSN 2083-5892, Bd. 22 (2002), 1, S. 101-109
https://doi.org/10.7151/dmgt.1160
Kostochka, Alexandr V.; Stiebitz, Michael;
A list version of Dirac's theorem on the number of edges in colour-critical graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 39 (2002), 3, S. 165-177
https://doi.org/10.1002/jgt.998
A list version of Dirac's theorem on the number of edges in colour-critical graphs. - In: Journal of graph theory, ISSN 1097-0118, Bd. 39 (2002), 3, S. 165-177
https://doi.org/10.1002/jgt.998
Brandt, Stephan;
A 4-colour problem for dense triangle-free graphs. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 33-46
http://dx.doi.org/10.1016/S0012-365X(01)00340-5
A 4-colour problem for dense triangle-free graphs. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 33-46
http://dx.doi.org/10.1016/S0012-365X(01)00340-5
Voigt, Margit; Walther, Hansjoachim
Polyhedral graphs with restricted number of faces of the same type. - In: Discrete mathematics, Bd. 244 (2002), 1/3, S. 473-478
http://dx.doi.org/10.1016/S0012-365X(01)00103-0
Polyhedral graphs with restricted number of faces of the same type. - In: Discrete mathematics, Bd. 244 (2002), 1/3, S. 473-478
http://dx.doi.org/10.1016/S0012-365X(01)00103-0
Tuza, Zsolt;
Voigt, Margit
A note on planar 5-list colouring: non-extendability at distance 4. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 169-172
http://dx.doi.org/10.1016/S0012-365X(01)00338-7
A note on planar 5-list colouring: non-extendability at distance 4. - In: Discrete mathematics, Bd. 251 (2002), 1/3, S. 169-172
http://dx.doi.org/10.1016/S0012-365X(01)00338-7