Volume 96,
Number 1,
January 2006
- Frédéric Maffray, Nicolas Trotignon:
A class of perfectly contractile graphs.
1-19
Electronic Edition (link) BibTeX
- Michael Stiebitz, Riste Skrekovski:
A map colour theorem for the union of graphs.
20-37
Electronic Edition (link) BibTeX
- Federico Ardila, Caroline J. Klivans:
The Bergman complex of a matroid and phylogenetic trees.
38-49
Electronic Edition (link) BibTeX
- Joseph P. S. Kung:
A Tutte decomposition for matrices and bimatroids.
50-66
Electronic Edition (link) BibTeX
- Yan-Quan Feng:
Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets.
67-72
Electronic Edition (link) BibTeX
- Daniela Kühn, Deryk Osthus:
Extremal connectivity for topological cliques in bipartite graphs.
73-99
Electronic Edition (link) BibTeX
- Daniel Král:
Extending partial 5-colorings and 6-colorings in planar graphs.
100-110
Electronic Edition (link) BibTeX
- Joel Friedman, Ram Murty, Jean-Pierre Tillich:
Spectral estimates for Abelian Cayley graphs.
111-121
Electronic Edition (link) BibTeX
- Dhruv Mubayi:
A hypergraph extension of Turán's theorem.
122-134
Electronic Edition (link) BibTeX
- Manoel Lemos, James G. Oxley:
Matroid packing and covering with circuits through an element.
135-158
Electronic Edition (link) BibTeX
- Judith Keijsper, Rudi Pendavingh, Leen Stougie:
A linear programming formulation of Mader's edge-disjoint paths problem.
159-163
Electronic Edition (link) BibTeX
- Cai Heng Li, Zai Ping Lu, Hua Zhang:
Tetravalent edge-transitive Cayley graphs with odd number of vertices.
164-181
Electronic Edition (link) BibTeX
Volume 96,
Number 2,
March 2006
Volume 96,
Number 3,
May 2006
- Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito:
A pair of forbidden subgraphs and perfect matchings.
315-324
Electronic Edition (link) BibTeX
- Petr Hlinený:
Branch-width, parse trees, and monadic second-order logic for matroids.
325-351
Electronic Edition (link) BibTeX
- Michael U. Gerber, Alain Hertz, Vadim V. Lozin:
Augmenting chains in graphs without a skew star.
352-366
Electronic Edition (link) BibTeX
- Sebastian M. Cioaba:
On the extreme eigenvalues of regular graphs.
367-373
Electronic Edition (link) BibTeX
- Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler:
Dominating sets in k-majority tournaments.
374-387
Electronic Edition (link) BibTeX
- Hein van der Holst:
Graphs and obstructions in four dimensions.
388-404
Electronic Edition (link) BibTeX
- James F. Geelen, Bert Gerards, Geoff Whittle:
On Rota's conjecture and excluded minors containing large projective geometries.
405-425
Electronic Edition (link) BibTeX
- Vladimir P. Korzhik:
On the maximal distance between triangular embeddings of a complete graph.
426-435
Electronic Edition (link) BibTeX
Note
Volume 96,
Number 4,
July 2006
- Juan José Montellano-Ballesteros, Ricardo Strausz:
A characterization of cocircuit graphs of uniform oriented matroids.
445-454
Electronic Edition (link) BibTeX
- Petr Hlinený:
Crossing number is hard for cubic graphs.
455-471
Electronic Edition (link) BibTeX
- Michael O. Albertson, Douglas B. West:
Extending precolorings to circular colorings.
472-481
Electronic Edition (link) BibTeX
- Xingxing Yu, Florian Zickfeld:
Reducing Hajós' 4-coloring conjecture to 4-connected graphs.
482-492
Electronic Edition (link) BibTeX
- Hong-Jian Lai, Yehong Shao, Mingquan Zhan:
Hamiltonicity in 3-connected claw-free graphs.
493-504
Electronic Edition (link) BibTeX
- Serguei Norine, Robin Thomas:
Minimal bricks.
505-513
Electronic Edition (link) BibTeX
- Sang-il Oum, Paul D. Seymour:
Approximating clique-width and branch-width.
514-528
Electronic Edition (link) BibTeX
- Mark N. Ellingham, Chris Stephens, Xiaoya Zha:
The nonorientable genus of complete tripartite graphs.
529-559
Electronic Edition (link) BibTeX
- James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle:
Obstructions to branch-decomposition of matroids.
560-570
Electronic Edition (link) BibTeX
- Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
Every 3-connected, essentially 11-connected line graph is Hamiltonian.
571-576
Electronic Edition (link) BibTeX
- Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad:
A relation between choosability and uniquely list colorability.
577-583
Electronic Edition (link) BibTeX
- Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi:
Short paths in quasi-random triple systems with sparse underlying graphs.
584-607
Electronic Edition (link) BibTeX
Notes
Volume 96,
Number 5,
September 2006
Notes
Corrigendum
Volume 96,
Number 6,
November 2006
- Daniela Kühn, Deryk Osthus:
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree.
767-821
Electronic Edition (link) BibTeX
- Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor.
822-845
Electronic Edition (link) BibTeX
- Reinhard Diestel:
End spaces and spanning trees.
846-854
Electronic Edition (link) BibTeX
- András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
An improved bound for the monochromatic cycle partition number.
855-873
Electronic Edition (link) BibTeX
- Anthony Bonato, Claude Tardif:
Mutually embeddable graphs and the tree alternative conjecture.
874-880
Electronic Edition (link) BibTeX
- Matthias Kriesell:
Contractions, cycle double covers, and cyclic colorings in locally connected graphs.
881-900
Electronic Edition (link) BibTeX
- Matthias Beck, Thomas Zaslavsky:
The number of nowhere-zero flows on graphs and signed graphs.
901-918
Electronic Edition (link) BibTeX
- József Balogh, Peter Keevash, Benny Sudakov:
On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs.
919-932
Electronic Edition (link) BibTeX
- László Lovász, Balázs Szegedy:
Limits of dense graph sequences.
933-957
Electronic Edition (link) BibTeX
Notes
Copyright © Sun May 17 00:08:49 2009
by Michael Ley (ley@uni-trier.de)
