Journal of combinatorial theory. Series B
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
- Página 1 de 1
