default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 91
Volume 91, Number 1, May 2004
- József Balogh, Béla Bollobás, Miklós Simonovits:
The number of graphs without forbidden subgraphs. 1-24 - Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour
, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. 25-41 - Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei:
Long cycles in triangle-free graphs with prescribed independence number and connectivity. 43-55 - Fred C. Holroyd, Martin Koviera:
Colouring of cubic graphs by Steiner triple systems. 57-66 - Iiro S. Honkala, Tero Laihonen:
On identification in the triangular grid. 67-86 - Mark E. Watkins, Jack E. Graver:
A characterization of infinite planar primitive graphs. 87-104 - James F. Geelen, James G. Oxley, Dirk Vertigan, Geoff Whittle:
A short proof of non-GF(5)-representability of matroids. 105-121 - Serguei Norine, Charles H. C. Little, Kee L. Teo:
A new proof of a characterisation of Pfaffian bipartite graphs. 123-126 - Mark S. MacLean:
Taut distance-regular graphs of even diameter. 127-142 - Dragan Stevanovic:
The largest eigenvalue of nonregular graphs. 143-146
Volume 91, Number 2, July 2004
- Shlomo Hoory, Nathan Linial:
Colorings of the d-regular infinite tree. 161-167 - Hirobumi Mizuno, Iwao Sato:
Weighted zeta functions of graphs. 169-183 - Tamás Király:
Covering symmetric supermodular functions by uniform hypergraphs. 185-200 - Gyula Pap, László Szegö:
On the maximum even factor in weakly symmetric graphs. 201-213 - Yair Caro, Raphael Yuster:
Edge coloring complete uniform hypergraphs with many components. 215-227 - Dan Archdeacon, C. Paul Bonnington:
Obstructions for embedding cubic graphs on the spindle surface. 229-252 - Vladimir P. Korzhik, Heinz-Jürgen Voss:
Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs. 253-287 - Primoz Potocnik:
Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms. 289-300 - Xiaotie Deng, Guojun Li, Wenan Zang:
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs. 301-325 - Xiangqian Zhou:
On internally 4-connected non-regular binary matroids. 327-343 - Gordon F. Royle, Alan D. Sokal:
The Brown-Colbourn conjecture on zeros of reliability polynomials is false. 345-360
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-02-15 00:18 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:
