nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A 4-colour problem for dense triangle-free graphs
|
Brandt, Stephan |
|
2002 |
251 |
1-3 |
p. 33-46 14 p. |
artikel |
2 |
A note on hamiltonicity of generalized net-free graphs of large diameter
|
Brousek, Jan |
|
2002 |
251 |
1-3 |
p. 77-85 9 p. |
artikel |
3 |
A note on planar 5-list colouring: non-extendability at distance 4
|
Tuza, Zs. |
|
2002 |
251 |
1-3 |
p. 169-172 4 p. |
artikel |
4 |
Author index
|
|
|
2002 |
251 |
1-3 |
p. 181- 1 p. |
artikel |
5 |
Forbidden triples for hamiltonicity
|
Brousek, Jan |
|
2002 |
251 |
1-3 |
p. 71-76 6 p. |
artikel |
6 |
Hamiltonicity of planar cubic multigraphs
|
Skupień, Zdzisław |
|
2002 |
251 |
1-3 |
p. 163-168 6 p. |
artikel |
7 |
Meet- and join-irreducibility of additive hereditary properties of graphs
|
Berger, Amelie J. |
|
2002 |
251 |
1-3 |
p. 11-18 8 p. |
artikel |
8 |
Minimal reducible bounds in the lattice of additive hereditary graph properties
|
Berger, Amelie J. |
|
2002 |
251 |
1-3 |
p. 3-10 8 p. |
artikel |
9 |
On cyclically embeddable (n,n−1)-graphs
|
Woźniak, Mariusz |
|
2002 |
251 |
1-3 |
p. 173-179 7 p. |
artikel |
10 |
On induced Ramsey numbers
|
Gorgol, Izolda |
|
2002 |
251 |
1-3 |
p. 87-96 10 p. |
artikel |
11 |
On light graphs in the family of 4-connected planar graphs
|
Hexel, Erhard |
|
2002 |
251 |
1-3 |
p. 103-107 5 p. |
artikel |
12 |
On pancyclism in hamiltonian graphs
|
Kouider, Mekkia |
|
2002 |
251 |
1-3 |
p. 119-127 9 p. |
artikel |
13 |
On 2-regular subgraphs in polyhedral graphs
|
Göring, Frank |
|
2002 |
251 |
1-3 |
p. 97-102 6 p. |
artikel |
14 |
On some intriguing problems in hamiltonian graph theory—a survey
|
Broersma, H.J. |
|
2002 |
251 |
1-3 |
p. 47-69 23 p. |
artikel |
15 |
On the domination number of a graph
|
Pruchnewski, Anja |
|
2002 |
251 |
1-3 |
p. 129-136 8 p. |
artikel |
16 |
Preface
|
Horňák, Mirko |
|
2002 |
251 |
1-3 |
p. 1- 1 p. |
artikel |
17 |
Some extremal problems of graphs with local constraints
|
Borowiecki, Mieczysław |
|
2002 |
251 |
1-3 |
p. 19-32 14 p. |
artikel |
18 |
The crossing number of K2,3×C3
|
Klešč, Marián |
|
2002 |
251 |
1-3 |
p. 109-117 9 p. |
artikel |
19 |
Three-colourability and forbidden subgraphs. II: polynomial algorithms
|
Randerath, Bert |
|
2002 |
251 |
1-3 |
p. 137-153 17 p. |
artikel |
20 |
Two matroidal families on the edge set of a graph
|
Recski, András |
|
2002 |
251 |
1-3 |
p. 155-162 8 p. |
artikel |