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