Journal of Combinatorial Theory, Series B logo Academic Press logo

Publisher: Academic Press

Volume 80, Number 2, November 2000
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

< previous issue | next issue > | all issues

A Characterization of Graphs with No Cube Minor
pp. 179-201(23)
Author: Maharry J.

Vertex Set Partitions Preserving Conservativeness
pp. 202-217(16)
Authors: Ageev A.A.; Kostochka A.V.

Chromatic Roots and Hamiltonian Paths
pp. 218-224(7)
Author: Thomassen C.

Which Crossing Number Is It Anyway?
pp. 225-246(22)
Authors: Pach J.; Tóth G.

Zeta Functions of Graph Coverings
pp. 247-257(11)
Authors: Mizuno H.; Sato I.

Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments
pp. 258-276(19)
Authors: Cherlin G.L.; Latka B.J.

On the Dissection of Rectangles into Right-Angled Isosceles Triangles
pp. 277-319(43)
Authors: Skinner J.D.; Smith C.A.B.; Tutte W.T.

Contraction–Deletion Invariants for Graphs
pp. 320-345(26)
Authors: Bollobás B.; Pebody L.; Riordan O.

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
pp. 346-355(10)
Author: Schrijver A.

Face Size and the Maximum Genus of a Graph 1. Simple Graphs
pp. 356-370(15)
Authors: Huang Y.; Liu Y.

List of Forthcoming Articles
pp. 371-371(1)

Author Index for Volume 80
pp. 372-372(1)

< previous issue | next issue > | all issues

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A