Journal of Combinatorial Theory, Series B logo Academic Press logo

Publisher: Academic Press

Related content
Volume 86, Number 2, November 2002

< previous issue | all issues

Call for nominations
pp. 213-214(2)
Author: Fulkerson Prize D.R.

The Size of Bipartite Graphs with a Given Girth
pp. 215-220(6)
Author: Hoory S.

Reconstruction of Finite Truncated Semi-Modular Lattices
pp. 254-272(19)
Authors: Rampon J-X.; Schröder B.S.W.

Packing Odd Circuits in Eulerian Graphs
pp. 280-295(16)
Authors: Geelen J.F.; Guenin B.

On k-con-Critically n-Connected Graphs
pp. 296-314(19)
Author: Mader W.

Branch-Width and Rota's Conjecture
pp. 315-330(16)
Authors: Geelen J.; Whittle G.

Closure and Forbidden Pairs for Hamiltonicity
pp. 331-346(16)
Authors: Ryjáccaronek Z.

The Maximal Exceptional Graphs
pp. 347-363(17)
Authors: Cvetkovicacute D.; Lepovicacute M.; Rowlinson P.; Simicacute S.K.

Topological Minors in Graphs of Large Girth
pp. 364-380(17)
Authors: Kühn D.; Osthus D.

Packing Cycles in Graphs
pp. 381-407(27)
Authors: Ding G.; Zang W.

On the Size of Edge Chromatic Critical Graphs
pp. 408-412(5)
Authors: Sanders D.P.; Zhao Y.

Ramsey Properties of Families of Graphs
pp. 413-419(7)
Authors: Graham R.; Lstrokuczak T.; Rödl V.; Rucinacuteski A.

< previous issue | all issues

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page