default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 83
Volume 83, Number 1, September 2001
- Anna Galluccio, Luis A. Goddyn, Pavol Hell:
High-Girth Graphs Avoiding a Minor are Nearly Bipartite. 1-14 - James F. Geelen, Geoffrey P. Whittle:
Matroid 4-Connectivity: A Deletion-Contraction Theorem. 15-37 - Bojan Mohar, Neil Robertson:
Flexibility of Polyhedral Embeddings of Graphs in Surfaces. 38-57 - Stefanie Gerke, Colin McDiarmid:
Graph Imperfection. 58-78 - Stefanie Gerke, Colin McDiarmid:
Graph Imperfection II. 79-101 - Daniel P. Sanders, Yue Zhao:
A New Bound on the Cyclic Chromatic Number. 102-111 - Bertrand Guenin:
A Characterization of Weakly Bipartite Graphs. 112-168
Volume 83, Number 2, November 2001
- Florian Roussel, P. Rubio:
About Skew Partitions in Minimal Imperfect Graphs. 171-190 - Eli Berger:
Dynamic Monopolies of Constant Size. 191-200 - Daniel P. Sanders, Yue Zhao:
Planar Graphs of Maximum Degree Seven are Class I. 201-212 - Guantao Chen, Ronald J. Gould, Hao Li:
Partitioning Vertices of a Tournament into Independent Cycles. 213-220 - Tao Jiang:
On a Conjecture about Trees in Graphs with Large Girth. 221-232 - Abraham Berman, Xiao-Dong Zhang:
On the Spectral Radius of Graphs with Cut Vertices. 233-240 - Michael Krivelevich, Van H. Vu:
Choosability in Random Hypergraphs. 241-257 - Martin Kochol:
An Equivalent Version of the 3-Flow Conjecture. 258-261 - Carsten Thomassen
:
Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. 262-271 - Jason I. Brown, Carl A. Hickman, Alan D. Sokal, David G. Wagner:
On the Chromatic Roots of Generalized Theta Graphs. 272-297 - Criel Merino, Anna de Mier, Marc Noy:
Irreducibility of the Tutte Polynomial of a Connected Matroid. 298-304 - Matthias Kriesell:
Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. 305-319 - Michael U. Gerber, Alain Hertz:
A Transformation Which Preserves the Clique Number. 320-330 - Stéphan Thomassé:
Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. 331-333
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
