nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A fast algorithm for the maximum clique problem
|
Östergård, Patric R.J. |
|
2002 |
120 |
1-3 |
p. 197-207 11 p. |
artikel |
2 |
Algorithm for recognizing Cartesian graph bundles
|
Zmazek, Blaž |
|
2002 |
120 |
1-3 |
p. 275-302 28 p. |
artikel |
3 |
An approximation result for the interval coloring problem on claw-free chordal graphs
|
Confessore, Giuseppe |
|
2002 |
120 |
1-3 |
p. 73-90 18 p. |
artikel |
4 |
An inductive definition of cubic toroidal maps
|
Harmuth, Thomas |
|
2002 |
120 |
1-3 |
p. 117-140 24 p. |
artikel |
5 |
A note on minimum degree conditions for supereulerian graphs
|
Broersma, H.J. |
|
2002 |
120 |
1-3 |
p. 35-43 9 p. |
artikel |
6 |
A note on transitive orientations with maximum sets of sources and sinks
|
de Figueiredo, Celina M.H. |
|
2002 |
120 |
1-3 |
p. 91-95 5 p. |
artikel |
7 |
A single-element extension of antimatroids
|
Nakamura, Masataka |
|
2002 |
120 |
1-3 |
p. 159-164 6 p. |
artikel |
8 |
Author index
|
|
|
2002 |
120 |
1-3 |
p. 303-304 2 p. |
artikel |
9 |
Coloring permutation graphs in parallel
|
Nikolopoulos, Stavros D. |
|
2002 |
120 |
1-3 |
p. 165-195 31 p. |
artikel |
10 |
Foreword
|
Faigle, Ulrich |
|
2002 |
120 |
1-3 |
p. 1- 1 p. |
artikel |
11 |
Graphs having distance-n domination number half their order
|
Fischermann, Miranca |
|
2002 |
120 |
1-3 |
p. 97-107 11 p. |
artikel |
12 |
k-Subdomination in graphs
|
Chang, Gerard J. |
|
2002 |
120 |
1-3 |
p. 55-60 6 p. |
artikel |
13 |
Length-bounded disjoint paths in planar graphs
|
van der Holst, H. |
|
2002 |
120 |
1-3 |
p. 251-261 11 p. |
artikel |
14 |
On the Frame–Stewart algorithm for the multi-peg Tower of Hanoi problem
|
Klavžar, Sandi |
|
2002 |
120 |
1-3 |
p. 141-157 17 p. |
artikel |
15 |
On the upper chromatic number of (v 3,b 2)-configurations
|
Arbib, Claudio |
|
2002 |
120 |
1-3 |
p. 3-12 10 p. |
artikel |
16 |
Pancyclic orderings of in-tournaments
|
Tewes, Meike |
|
2002 |
120 |
1-3 |
p. 239-249 11 p. |
artikel |
17 |
Polyhedral graphs with extreme numbers of types of faces
|
Walther, Hansjoachim |
|
2002 |
120 |
1-3 |
p. 263-274 12 p. |
artikel |
18 |
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
|
Bauer, D. |
|
2002 |
120 |
1-3 |
p. 13-23 11 p. |
artikel |
19 |
Some approaches to a conjecture on short cycles in digraphs
|
Broersma, H.J. |
|
2002 |
120 |
1-3 |
p. 45-53 9 p. |
artikel |
20 |
The cycle structure of regular multipartite tournaments
|
Guo, Yubao |
|
2002 |
120 |
1-3 |
p. 109-116 8 p. |
artikel |
21 |
The incidentor coloring of multigraphs and its applications
|
Pyatkin, A.V. |
|
2002 |
120 |
1-3 |
p. 209-217 9 p. |
artikel |
22 |
The structure of obstructions to treewidth and pathwidth
|
Chlebı́ková, Janka |
|
2002 |
120 |
1-3 |
p. 61-71 11 p. |
artikel |
23 |
Triangle-free graphs and forbidden subgraphs
|
Brandt, Stephan |
|
2002 |
120 |
1-3 |
p. 25-33 9 p. |
artikel |
24 |
Vertex pancyclic graphs
|
Randerath, Bert |
|
2002 |
120 |
1-3 |
p. 219-237 19 p. |
artikel |