nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterization of level planar graphs
|
Healy, Patrick |
|
2004 |
280 |
1-3 |
p. 51-63 13 p. |
artikel |
2 |
An infinite family of cubic edge- but not vertex-transitive graphs
|
Malnič, Aleksander |
|
2004 |
280 |
1-3 |
p. 133-148 16 p. |
artikel |
3 |
A note on balance vertices in trees
|
Shan, Erfang |
|
2004 |
280 |
1-3 |
p. 265-269 5 p. |
artikel |
4 |
A note on the approximability of the toughness of graphs
|
Bazgan, Cristina |
|
2004 |
280 |
1-3 |
p. 215-218 4 p. |
artikel |
5 |
Author index to volume 280
|
|
|
2004 |
280 |
1-3 |
p. 283-284 2 p. |
artikel |
6 |
Book announcements
|
|
|
2004 |
280 |
1-3 |
p. 281-282 2 p. |
artikel |
7 |
Comment on “The Steiner number of a graph” by G. Chartrand and P. Zhang
|
Pelayo, Ignacio M |
|
2004 |
280 |
1-3 |
p. 259-263 5 p. |
artikel |
8 |
Concerning two conjectures on the set of fixed points of a complete rotation of a Cayley digraph
|
Lichiardopol, Nicolas |
|
2004 |
280 |
1-3 |
p. 119-131 13 p. |
artikel |
9 |
Consequences of an algorithm for bridged graphs
|
Bang Le, Van |
|
2004 |
280 |
1-3 |
p. 271-274 4 p. |
artikel |
10 |
Contents
|
|
|
2004 |
280 |
1-3 |
p. viii-x nvt p. |
artikel |
11 |
Degree conditions for Hamiltonian graphs to have [a,b]-factors containing a given Hamiltonian cycle
|
Matsuda, Haruhide |
|
2004 |
280 |
1-3 |
p. 241-250 10 p. |
artikel |
12 |
Directed triangles in directed graphs
|
de Graaf, Maurits |
|
2004 |
280 |
1-3 |
p. 219-223 5 p. |
artikel |
13 |
Editorial board
|
|
|
2004 |
280 |
1-3 |
p. v-vii nvt p. |
artikel |
14 |
Enumerating symmetric directed convex polyominoes
|
Deutsch, Emeric |
|
2004 |
280 |
1-3 |
p. 225-231 7 p. |
artikel |
15 |
Explicit enumeration of 321, hexagon-avoiding permutations
|
Stankova, Zvezdelina |
|
2004 |
280 |
1-3 |
p. 165-189 25 p. |
artikel |
16 |
Forthcoming special issues
|
|
|
2004 |
280 |
1-3 |
p. 275-276 2 p. |
artikel |
17 |
Graphs with no M-alternating path between two vertices
|
Lou, Dingjun |
|
2004 |
280 |
1-3 |
p. 237-240 4 p. |
artikel |
18 |
Guide for authors
|
|
|
2004 |
280 |
1-3 |
p. 299-302 4 p. |
artikel |
19 |
List of referees
|
|
|
2004 |
280 |
1-3 |
p. 277-279 3 p. |
artikel |
20 |
Master index to volumes 271-280
|
|
|
2004 |
280 |
1-3 |
p. 285-297 13 p. |
artikel |
21 |
Measurements of edge-uncolorability
|
Steffen, Eckhard |
|
2004 |
280 |
1-3 |
p. 191-214 24 p. |
artikel |
22 |
Miscellaneous classification results for 2-designs
|
Kaski, Petteri |
|
2004 |
280 |
1-3 |
p. 65-75 11 p. |
artikel |
23 |
More examples on ordered set reconstruction
|
Schröder, Bernd S.W |
|
2004 |
280 |
1-3 |
p. 149-163 15 p. |
artikel |
24 |
Note on André's reflection principle
|
Loehr, Nicholas A |
|
2004 |
280 |
1-3 |
p. 233-236 4 p. |
artikel |
25 |
On some Rado numbers for generalized arithmetic progressions
|
Grynkiewicz, David J. |
|
2004 |
280 |
1-3 |
p. 39-50 12 p. |
artikel |
26 |
On the minor-minimal 2-connected graphs having a fixed minor
|
Lemos, Manoel |
|
2004 |
280 |
1-3 |
p. 77-118 42 p. |
artikel |
27 |
Polybasic polyhedra: structure of polyhedra with edge vectors of support size at most 2
|
Fujishige, Satoru |
|
2004 |
280 |
1-3 |
p. 13-27 15 p. |
artikel |
28 |
Some geometric structures and bounds for Ramsey numbers
|
Gonçalves, Adilson |
|
2004 |
280 |
1-3 |
p. 29-38 10 p. |
artikel |
29 |
Sum coloring and interval graphs: a tight upper bound for the minimum number of colors
|
Nicoloso, S |
|
2004 |
280 |
1-3 |
p. 251-257 7 p. |
artikel |
30 |
Unavoidable doubly connected large graphs
|
Ding, Guoli |
|
2004 |
280 |
1-3 |
p. 1-12 12 p. |
artikel |