Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 80
Volume 80, Number 1, September 2000
- Frédéric Havet:
Oriented Hamiltonian Cycles in Tournaments. 1-31 - Matthias Kriesell:
Contractible Subgraphs in 3-Connected Graphs. 32-48 - Jeong Han Kim, Boris G. Pittel:
On Tail Distribution of Interpost Distance. 49-56 - James F. Geelen, James G. Oxley, Dirk Vertigan, Geoffrey P. Whittle:
On the Excluded Minors for Quaternary Matroids. 57-68 - Ya-Chen Chen:
Kneser Graphs Are Hamiltonian For nge3k. 69-79 - Jaroslav Nesetril
, Claude Tardif:
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations). 80-97 - Nancy Eaton:
A Near Packing of Two Graphs. 98-103 - Sergei K. Lando:
On a Hopf Algebra in Graph Theory. 104-121 - Andrew M. Robertshaw, Douglas R. Woodall:
Triangles and Neighbourhoods of Independent Sets in Graphs. 122-129 - David D. Gebhard, Bruce E. Sagan:
Sinks in Acyclic Orientations of Graphs. 130-146 - Jaroslav Nesetril, André Raspaud:
Colored Homomorphisms of Colored Mixed Graphs. 147-155 - Atsushi Kaneko, Katsuhiro Ota:
On Minimally (n, )-Connected Graphs. 156-171 - Duncan C. Richer:
Unordered Canonical Ramsey Numbers. 172-177
Volume 80, Number 2, November 2000
- John Maharry:
A Characterization of Graphs with No Cube Minor. 179-201 - Alexander A. Ageev, Alexandr V. Kostochka:
Vertex Set Partitions Preserving Conservativeness. 202-217 - Carsten Thomassen:
Chromatic Roots and Hamiltonian Paths. 218-224 - János Pach, Géza Tóth:
Which Crossing Number Is It Anyway? 225-246 - Hirobumi Mizuno, Iwao Sato:
Zeta Functions of Graph Coverings. 247-257 - Gregory L. Cherlin, Brenda J. Latka:
Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments. 258-276 - J. D. Skinner II, C. A. B. Smith, W. T. Tutte:
On the Dissection of Rectangles into Right-Angled Isosceles Triangles. 277-319 - Béla Bollobás, Luke Pebody, Oliver Riordan:
Contraction-Deletion Invariants for Graphs. 320-345 - Alexander Schrijver:
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. 346-355 - Yuanqiu Huang, Yanpei Liu:
Face Size and the Maximum Genus of a Graph 1. Simple Graphs. 356-370
a service of 
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 2024-05-07 23:52 CEST 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:
