Journal: Journal of Combinatorial Theory, Series A

Volume 96, Issue 6

767 -- 821Daniela Kühn, Deryk Osthus. Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
822 -- 845Guantao Chen, Laura Sheppardson, Xingxing Yu, Wenan Zang. The circumference of a graph with no K::3, t::-minor
846 -- 854Reinhard Diestel. End spaces and spanning trees
855 -- 873Andrá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
874 -- 880Anthony Bonato, Claude Tardif. Mutually embeddable graphs and the tree alternative conjecture
881 -- 900Matthias Kriesell. Contractions, cycle double covers, and cyclic colorings in locally connected graphs
901 -- 918Matthias Beck, Thomas Zaslavsky. The number of nowhere-zero flows on graphs and signed graphs
919 -- 932József Balogh, Peter Keevash, Benny Sudakov. On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
933 -- 957László Lovász, Balázs Szegedy. Limits of dense graph sequences
958 -- 963Baogang Xu. On 3-colorable plane graphs without 5- and 7-cycles
964 -- 972Thom Sulanke. Note on the irreducible triangulations of the Klein bottle

Volume 96, Issue 5

623 -- 672Mireille Bousquet-Mélou, Arnaud Jehanne. Polynomial equations with one catalytic variable, algebraic series and map enumeration
673 -- 683Jing Huang. Representation characterizations of chordal bipartite graphs
684 -- 692Zoltán Király, Zoltán Szigeti. Simultaneous well-balanced orientations of graphs
693 -- 705David Hartvigsen. Finding maximum square-free 2-matchings in bipartite graphs
706 -- 729Alexander Mednykh, Roman Nedela. Enumeration of unrooted maps of a given genus
730 -- 739Jaroslav Nesetril, Patrice Ossona de Mendez. Folding
740 -- 753Bojan Mohar. Tree amalgamation of graphs and tessellations of the Cantor sphere
754 -- 757Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan. Proper minor-closed families are small
758 -- 760Lilian Matthiesen. There are uncountably many topological types of locally finite trees
761 -- 764Dragan Marusic. Corrigendum to On 2-arc-transitivity of Cayley graphs [J. Combin. Theory Series B 87 (2003) 162-196]

Volume 96, Issue 4

445 -- 454Juan José Montellano-Ballesteros, Ricardo Strausz. A characterization of cocircuit graphs of uniform oriented matroids
455 -- 471Petr Hlinený. Crossing number is hard for cubic graphs
472 -- 481Michael O. Albertson, Douglas B. West. Extending precolorings to circular colorings
482 -- 492Xingxing Yu, Florian Zickfeld. Reducing Hajós 4-coloring conjecture to 4-connected graphs
493 -- 504Hong-Jian Lai, Yehong Shao, Mingquan Zhan. Hamiltonicity in 3-connected claw-free graphs
505 -- 513Serguei Norine, Robin Thomas. Minimal bricks
514 -- 528Sang-il Oum, Paul D. Seymour. Approximating clique-width and branch-width
529 -- 559Mark N. Ellingham, Chris Stephens, Xiaoya Zha. The nonorientable genus of complete tripartite graphs
560 -- 570James F. Geelen, Bert Gerards, Neil Robertson, Geoff Whittle. Obstructions to branch-decomposition of matroids
571 -- 576Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou. Every 3-connected, essentially 11-connected line graph is Hamiltonian
577 -- 583Saieed Akbari, Vahab S. Mirrokni, Bashir S. Sadjad. A relation between choosability and uniquely list colorability
584 -- 607Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi. Short paths in quasi-random triple systems with sparse underlying graphs
608 -- 613Yonatan Bilu. Tales of Hoffman: Three extensions of Hoffman s bound on the graph chromatic number
614 -- 620Peter Keevash, Benny Sudakov. Sparse halves in triangle-free graphs

Volume 96, Issue 3

315 -- 324Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito. A pair of forbidden subgraphs and perfect matchings
325 -- 351Petr Hlinený. Branch-width, parse trees, and monadic second-order logic for matroids
352 -- 366Michael U. Gerber, Alain Hertz, Vadim V. Lozin. Augmenting chains in graphs without a skew star
367 -- 373Sebastian M. Cioaba. On the extreme eigenvalues of regular graphs
374 -- 387Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler. Dominating sets in k-majority tournaments
388 -- 404Hein van der Holst. Graphs and obstructions in four dimensions
405 -- 425James F. Geelen, Bert Gerards, Geoff Whittle. On Rota s conjecture and excluded minors containing large projective geometries
426 -- 435Vladimir P. Korzhik. On the maximal distance between triangular embeddings of a complete graph
436 -- 442Nathan Linial, Eran London. On the expansion rate of Margulis expanders

Volume 96, Issue 2

183 -- 206Roland Häggkvist, Klas Markström. Cycle double covers and spanning minors I
199 -- 260Peter Rowley. On the Minimal Parabolic System Related to the Monster Simple Group
207 -- 224Andrew J. Goodall. Some new evaluations of the Tutte polynomial
225 -- 239Henning Bruhn, Maya Jakobine Stein. MacLane s planarity criterion for locally finite graphs
240 -- 252Zi-Xia Song, Robin Thomas. The extremal function for ::::K::::::9:: minors
253 -- 275Christopher Carl Heckman, Robin Thomas. Independent sets in triangle-free cubic planar graphs
261 -- 287Alex Samorodnitsky. On the Optimum of Delsarte s Linear Program
276 -- 295Su Jianji, Yuan Xudong. A new degree sum condition for the existence of a contractible edge in a ::::kappa::::-connected graph
288 -- 302Gerard van der Laan, Dolf Talman, Zaifu Yang. Existence of Balanced Simplices on Polytopes
296 -- 301Ken-ichi Kawarabayashi, Paul Wollan. Non-zero disjoint cycles in highly connected group labelled graphs
302 -- 312Maya Jakobine Stein. Arboricity and tree-packing in locally finite graphs
303 -- 315Michel Lavrauw, Tim Penttila. On Eggs and Translation Generalised Quadrangles
316 -- 325János Pach, József Solymosi. Crossing Patterns of Segments
326 -- 340Mercedes H. Rosas. MacMahon Symmetric Functions, the Partition Lattice, and Young Subgroups
341 -- 357Robert A. Beezer. Counting Configurations in Designs
358 -- 375Robert Craigen, Christos Koukouvinos. A Theory of Ternary Complementary Pairs
376 -- 387Dieter Jungnickel, Vassili C. Mavron, T. P. McDonough. The Geometry of Frequency Squares
388 -- 395S. P. Inamdar. Rigidity Theorems for Partial Linear Spaces
396 -- 399Alexei E. Ashikhmin, Alexander Barg, Serge G. Vladut. Linear Codes with Exponentially Many Light Vectors

Volume 96, Issue 1

1 -- 19Frédéric Maffray, Nicolas Trotignon. A class of perfectly contractile graphs
1 -- 19Gil Kaplan, Arieh Lev, Yehuda Roditty. Regular Oberwolfach Problems and Group Sequencings
20 -- 37Michael Stiebitz, Riste Skrekovski. A map colour theorem for the union of graphs
20 -- 30S. P. Inamdar, N. S. Narasimha Sastry. Codes from Veronese and Segre Embeddings and Hamada s Formula
31 -- 88Ilse Fischer. Enumeration of Rhombus Tilings of a Hexagon which Contain a Fixed Rhombus in the Centre
38 -- 49Federico Ardila, Caroline J. Klivans. The Bergman complex of a matroid and phylogenetic trees
50 -- 66Joseph P. S. Kung. A Tutte decomposition for matrices and bimatroids
67 -- 72Yan-Quan Feng. Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
73 -- 99Daniela Kühn, Deryk Osthus. Extremal connectivity for topological cliques in bipartite graphs
89 -- 126Hsien-Kuei Hwang. Limit Theorems for the Number of Summands in Integer Partitions
100 -- 110Daniel Král. Extending partial 5-colorings and 6-colorings in planar graphs
111 -- 121Joel Friedman, Ram Murty, Jean-Pierre Tillich. Spectral estimates for Abelian Cayley graphs
122 -- 134Dhruv Mubayi. A hypergraph extension of Turán s theorem
127 -- 161Tom Roby, Frank Sottile, Jeffrey Stroomer, Julian West. Complementary Algorithms for Tableaux
135 -- 158Manoel Lemos, James G. Oxley. Matroid packing and covering with circuits through an element
159 -- 163Judith Keijsper, Rudi Pendavingh, Leen Stougie. A linear programming formulation of Mader s edge-disjoint paths problem
162 -- 179Burkard Polster, Hendrik Van Maldeghem. Some Constructions of Small Generalized Polygons
164 -- 181Cai Heng Li, Zai Ping Lu, Hua Zhang. Tetravalent edge-transitive Cayley graphs with odd number of vertices
180 -- 191Gary L. Ebert, Sebastian Egner, Henk D. L. Hollmann, Qing Xiang. A Four-Class Association Scheme
192 -- 198Dongsu Kim, Jiang Zeng. A New Decomposition of Derangements