nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A generalization of Dirac's theorem: Subdivisions of wheels
|
Turner III, Galen E. |
|
2005 |
297 |
1-3 |
p. 202-205 4 p. |
artikel |
2 |
A note on 3-choosability of planar graphs without certain cycles
|
Zhang, Li |
|
2005 |
297 |
1-3 |
p. 206-209 4 p. |
artikel |
3 |
Author index to volume
|
|
|
2005 |
297 |
1-3 |
p. 214-215 2 p. |
artikel |
4 |
Contents
|
|
|
2005 |
297 |
1-3 |
p. viii-ix nvt p. |
artikel |
5 |
Counting embeddings of a chain into a tree
|
Kuchta, Małgorzata |
|
2005 |
297 |
1-3 |
p. 49-59 11 p. |
artikel |
6 |
C 3 saturated graphs
|
Ashkenazi, Yehuda |
|
2005 |
297 |
1-3 |
p. 152-158 7 p. |
artikel |
7 |
Editorial board
|
|
|
2005 |
297 |
1-3 |
p. v-vii nvt p. |
artikel |
8 |
Embedding path designs into kite systems
|
Colbourn, Charles J. |
|
2005 |
297 |
1-3 |
p. 38-48 11 p. |
artikel |
9 |
Erratum to “On removable even circuits in graphs” [Discrete Math. 286 (2004) 177–184]
|
Sinclair, Philip A. |
|
2005 |
297 |
1-3 |
p. 210-213 4 p. |
artikel |
10 |
Extensions of Boolean isometries
|
Avilés, Antonio |
|
2005 |
297 |
1-3 |
p. 1-12 12 p. |
artikel |
11 |
Guide for authors
|
|
|
2005 |
297 |
1-3 |
p. 216-219 4 p. |
artikel |
12 |
Integral trees with diameters 5 and 6
|
Wang, Ligong |
|
2005 |
297 |
1-3 |
p. 128-143 16 p. |
artikel |
13 |
Kemnitz’ conjecture revisited
|
Savchev, Svetoslav |
|
2005 |
297 |
1-3 |
p. 196-201 6 p. |
artikel |
14 |
Nowhere-zero 3-flows in abelian Cayley graphs
|
Potočnik, Primož |
|
2005 |
297 |
1-3 |
p. 119-127 9 p. |
artikel |
15 |
On a Turán-type hypergraph problem of Brown, Erdős and T. Sós
|
Sárközy, Gábor N. |
|
2005 |
297 |
1-3 |
p. 190-195 6 p. |
artikel |
16 |
On optimal orientation of cycle vertex multiplications
|
Ng, K.L. |
|
2005 |
297 |
1-3 |
p. 104-118 15 p. |
artikel |
17 |
On the Anderson–Lipman conjecture and some related problems
|
Jaradat, M.M.M. |
|
2005 |
297 |
1-3 |
p. 167-173 7 p. |
artikel |
18 |
On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure
|
Kim, Hyun Kwang |
|
2005 |
297 |
1-3 |
p. 174-181 8 p. |
artikel |
19 |
Rebuilding convex sets in graphs
|
Cáceres, José |
|
2005 |
297 |
1-3 |
p. 26-37 12 p. |
artikel |
20 |
Reconstructing subgraph-counting graph polynomials of increasing families of graphs
|
Brešar, Boštjan |
|
2005 |
297 |
1-3 |
p. 159-166 8 p. |
artikel |
21 |
Reconstructing the number of blocks of an infinite graph
|
Andreae, Thomas |
|
2005 |
297 |
1-3 |
p. 144-151 8 p. |
artikel |
22 |
Requiring chords in cycles
|
McKee, Terry A. |
|
2005 |
297 |
1-3 |
p. 182-189 8 p. |
artikel |
23 |
Some equitably 3-colourable cycle decompositions of complete equipartite graphs
|
Lefevre, James |
|
2005 |
297 |
1-3 |
p. 60-77 18 p. |
artikel |
24 |
The distribution of elements in automatic double sequences
|
Moshe, Yossi |
|
2005 |
297 |
1-3 |
p. 91-103 13 p. |
artikel |
25 |
The recognition of bound quivers using edge-coloured homomorphisms
|
Brewster, Richard C. |
|
2005 |
297 |
1-3 |
p. 13-25 13 p. |
artikel |
26 |
Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
|
Matsumura, Hajime |
|
2005 |
297 |
1-3 |
p. 78-90 13 p. |
artikel |