nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterization of cocircuit graphs of uniform oriented matroids
|
Montellano-Ballesteros, Juan José |
|
2006 |
96 |
4 |
p. 445-454 10 p. |
artikel |
2 |
Approximating clique-width and branch-width
|
Oum, Sang-il |
|
2006 |
96 |
4 |
p. 514-528 15 p. |
artikel |
3 |
A relation between choosability and uniquely list colorability
|
Akbari, Saieed |
|
2006 |
96 |
4 |
p. 577-583 7 p. |
artikel |
4 |
Crossing number is hard for cubic graphs
|
Hliněný, Petr |
|
2006 |
96 |
4 |
p. 455-471 17 p. |
artikel |
5 |
Editorial Board
|
|
|
2006 |
96 |
4 |
p. i- 1 p. |
artikel |
6 |
Every 3-connected, essentially 11-connected line graph is Hamiltonian
|
Lai, Hong-Jian |
|
2006 |
96 |
4 |
p. 571-576 6 p. |
artikel |
7 |
Extending precolorings to circular colorings
|
Albertson, Michael O. |
|
2006 |
96 |
4 |
p. 472-481 10 p. |
artikel |
8 |
Hamiltonicity in 3-connected claw-free graphs
|
Lai, Hong-Jian |
|
2006 |
96 |
4 |
p. 493-504 12 p. |
artikel |
9 |
Minimal bricks
|
Norine, Serguei |
|
2006 |
96 |
4 |
p. 505-513 9 p. |
artikel |
10 |
Obstructions to branch-decomposition of matroids
|
Geelen, J. |
|
2006 |
96 |
4 |
p. 560-570 11 p. |
artikel |
11 |
Reducing Hajós' 4-coloring conjecture to 4-connected graphs
|
Yu, Xingxing |
|
2006 |
96 |
4 |
p. 482-492 11 p. |
artikel |
12 |
Short paths in quasi-random triple systems with sparse underlying graphs
|
Polcyn, Joanna |
|
2006 |
96 |
4 |
p. 584-607 24 p. |
artikel |
13 |
Sparse halves in triangle-free graphs
|
Keevash, Peter |
|
2006 |
96 |
4 |
p. 614-620 7 p. |
artikel |
14 |
Tales of Hoffman: Three extensions of Hoffman's bound on the graph chromatic number
|
Bilu, Yonatan |
|
2006 |
96 |
4 |
p. 608-613 6 p. |
artikel |
15 |
The nonorientable genus of complete tripartite graphs
|
Ellingham, M.N. |
|
2006 |
96 |
4 |
p. 529-559 31 p. |
artikel |