Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 74
Volume 74, Number 1, September 1998
- Matthias Kriesell:
On k-Critical Connected Line Graphs. 1-7 - Mike J. Grannell, Terry S. Griggs, Jozef Sirán:
Face 2-Colourable Triangular Embeddings of Complete Graphs. 8-19 - Kenneth A. Berman, Xin Liu:
Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem. 20-27 - Cai Heng Li:
On Isomorphisms of Connected Cayley Graphs, II. 28-34 - Winfried Hochstättler, Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, I. 35-52 - Winfried Hochstättler, Bill Jackson:
Large Circuits in Binary Matroids of Large Cogirth, II. 53-63 - Daniel P. Sanders, Yue Zhao:
On 2-Connected Spanning Subgraphs with Low Maximum Degree. 64-86 - Petr Hlinený
:
Classes and Recognition of Curve Contact Graphs, . 87-103 - Zoltán Szigeti:
The Two Ear Theorem on Matching-Covered Graphs. 104-109 - Brendan D. McKay, Mirka Miller, Jozef Sirán:
A Note on Large Graphs of Diameter Two and Given Maximum Degree, . 110-118
Volume 74, Number 2, November 1998
- Yves Colin de Verdière:
Multiplicities of Eigenvalues and Tree-Width of Graphs. 121-146 - Bruce A. Reed, Paul D. Seymour:
Fractional Colouring and Hadwiger's Conjecture. 147-152 - Hong Yuan:
Upper Bounds of the Spectral Radius of Graphs in Terms of Genus, . 153-159 - Armen S. Asratian:
Short Solution of Kotzig's Problem for Bipartite Graphs. 160-168 - Cláudia Linhares Sales, Frédéric Maffray:
Even Pairs in Claw-Free Perfect Graphs. 169-191 - Matthias Kriesell:
Contractible Non-edges in 3-Connected Graphs. 192-201 - Alexander Lubotzky, Tatiana Nagnibeda:
Not Every Uniform Tree Covers Ramanujan Graphs. 202-212 - Yoshimi Egawa:
Contractible Cycles in Graphs with Girth at Least 5. 213-264 - J. Adrian Bondy, Bill Jackson:
Vertices of Small Degree in Uniquely Hamiltonian Graphs. 265-275 - Shao-Fei Du, Dragan Marusic, Adrian O. Waller:
On 2-Arc-Transitive Covers of Complete Graphs. 276-290 - Shuhong Gao, Beth Novick, Ke Qiu:
From Hall's Matching Theorem to Optimal Routing on Hypercubes. 291-301 - Yue Zhao:
On the Edge Reconstruction of Graphs Embedded in Surfaces, III, . 302-310 - Jing Huang, Anders Yeo:
Maximal and Minimal Vertex-Critical Graphs of Diameter Two. 311-325 - Joanna A. Ellis-Monaghan:
New Results for the Martin Polynomial. 326-352 - Genghua Fan:
Proofs of Two Minimum Circuit Cover Conjectures. 353-367 - Pierre Ille, Jean-Xavier Rampon:
Reconstruction of Posets with the Same Comparability Graph. 368-377 - Dirk L. Vertigan:
Bicycle Dimension and Special Points of the Tutte Polynomial. 378-396 - Judith Keijsper:
An Algorithm for Packing Connectors. 397-404 - Jian Shen:
Directed Triangles in Digraphs. 405-407 - Sam Northshield:
A Note on the Zeta Function of a Graph. 408-410
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-04-22 20:02 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:
