Journal of combinatorial theory. Series B
Globally rigid circuits of the direction-length rigidity matroid
Bill Jackson
, Tibor Jordánpágs. 1-22
A bipartite strengthening of the Crossing Lemma
Jacob Fox, János Pach, Csaba D. Tóth
págs. 23-35
Lifts of matroid representations over partial fields
R. A. Pendavingh, Stefan H. M. van Zwam
págs. 36-67
Graph edge colouring: Tashkinov trees and Goldberg's conjecture
D. Scheide
págs. 68-96
Countable connected-homogeneous graphs
R. Gray, Dugald Macpherson
págs. 97-118
An analogue of the Gallai-Edmonds Structure Theorem for non-zero roots of the matching polynomial
Cheng Yeaw Ku, William Chen
págs. 119-127
The projective plane is a stabilizer
Jim Geelen, Geoff Whittle
págs. 128-131
An almost quadratic bound on vertex Folkman numbers
Andrzej Dudek, Vojtech Rödl
págs. 132-140
págs. 141-150
Weak hypergraph regularity and linear hypergraphs
Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht
págs. 151-160
The average order of a subtree of a tree
Andrew Vince, Hua Wang
págs. 161-170
Small graph classes and bounded expansion
Zdenek Dvorák, Serguei Norine
págs. 171-175
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
Stéphane Bessy, Stéphan Thomassé
págs. 176-180
Graph minors XXII: Nash-Williams' immersion conjecture
Neil Robertson, Paul D. Seymour
págs. 181-205
Packing paths in complete graphs
Darryn E. Bryant
págs. 206-215
A lower bound for the number of orientable triangular embeddings of some complete graphs
M. J. Grannell, M. Knor
págs. 216-225
Asymptotically optimal frugal colouring
Michael Molloy, Bruce Reed
págs. 226-246
Articles
Cycles of given length in oriented graphs
Luke Kelly, Daniela Kühn, Deryk Osthus
págs. 251-264
Oriented diameter of graphs with diameter 3
Peter K. Kwok, Qi Liu, Douglas B. West
págs. 265-274
On finite edge-primitive and edge-quasiprimitive graphs
Michael Giudici, Cai Heng Li
págs. 275-298
Anti-Ramsey properties of random graphs
Tom Bohman, Alan Frieze, Oleg Pikhurko, Clifford Smyth
págs. 299-312
K_4-free graphs with no odd holes
Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas
págs. 313-331
Dirac-type results for loose Hamilton cycles in uniform hypergraphs
Hiêp Hàn, Mathias Schacht
págs. 332-346
Notes
Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
Maciej Kalkowski, Michal Karonski, Florian Pfender
págs. 347-349
Circular edge-colorings of cubic graphs with girth six
Daniel Král', Edita Mácajová
, Ján Mazák, Jean-Sébastien Serenipágs. 351-358
The vertex primitive and vertex bi-primitive s-arc regular graphs
Cai Heng Li, Liang Niu, Akos Seress, Ronald Solomon
págs. 359-366
Hamiltonian degree sequences in digraphs
Daniela Kühn, Deryk Osthus, Andrew Treglown
págs. 367-380
págs. 381-389
On the isoperimetric spectrum of graphs and its approximations
Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi
págs. 390-412
Crossing-critical graphs with large maximum degree
Zdenek Dvorák, Bojan Mohar
págs. 413-417
- Página 1 de 2
