default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 50
Volume 50, Number 1, September 2005
- Michael D. Plummer, Akira Saito:
Forbidden subgraphs and bounds on the size of a maximum matching. 1-12 - Dragan Marusic
, Joy Morris:
Normal cirulant graphs with noncyclic regular subroups. 13-24 - Marston D. E. Conder, Aleksander Malnic, Dragan Marusic, Tomaz Pisanski, Primoz Potocnik:
The edge-transitive but not vertex-transitive cubic graph on 112 vertices. 25-42 - Bernard Montaron:
An improvement of the crossing number bound. 43-54 - Heinz Adolf Jung, Elkin Vumar:
Degree bounds for the circumference of 3-connected graphs. 55-78 - Jinlong Shu, Cun-Quan Zhang:
Nowhere-zero 3-flows in products of graphs. 79-89
Volume 50, Number 2, October 2005
- Danhong Zhang, Hong Wang:
Disjoint directed quadrilaterals in a directed graph. 91-104 - Jin Ho Kwak, Young Soo Kwon:
Regular orientable embeddings of complete bipartite graphs. 105-122 - Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss:
A note on group colorings. 123-129 - Zhiquan Hu, Feng Tian, Bing Wei:
Hamilton connectivity of line graphs and claw-free graphs. 130-141 - Paul Baginski:
A generalization of a Ramsey-type theorem on hypermatchings. 142-149 - Henning Bruhn, Reinhard Diestel, Maya Stein:
Cycle-cocycle partitions and faithful cycle covers for locally finite graphs. 150-161 - Shaun M. Fallat, Stephen J. Kirkland, Jason J. Molitierno, Michael Neumann:
On graphs whose Laplacian matrices have distinct integer eigenvalues. 162-174
Volume 50, Number 3, November 2005
- Lingsheng Shi:
Linear Ramsey numbers of sparse graphs. 175-185 - Sandi Klavzar, Bojan Mohar:
Crossing numbers of Sierpinski-like graphs. 186-198 - Henning Bruhn, Reinhard Diestel, Maya Stein:
Menger's theorem for infinite graphs with ends. 199-211 - Anders Yeo:
The number of pancyclic arcs in a k-strong tournament. 212-219 - Yared Nigussie, Neil Robertson:
On structural descriptions of lower ideals of trees. 220-233 - R. Bruce Richter, Gelasio Salazar:
Two maps with large representativity on one surface. 234-245 - Luis A. Goddyn, Ladislav Stacho:
Edge disjoint cycles through specified vertices. 246-260 - Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin:
Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties. 261
Volume 50, Number 4, December 2005
- Dan Hefetz:
Anti-magic graphs via the Combinatorial NullStellenSatz. 263-272 - Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West:
Nordhaus-Gaddum-type Theorems for decompositions into many parts. 273-292 - Ya-Chen Chen, Zoltán Füredi:
Minimum vertex-diameter-2-critical graphs. 293-315 - Yuansheng Yang, Chengye Zhao, Xiaohui Lin, Yongsong Jiang, Xin Hao:
Some 3-connected 4-edge-critical non-Hamiltonian graphs. 316-320 - Alexandr V. Kostochka, Gexin Yu:
An extremal problem for H-linked graphs. 321-339
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-11-02 21: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:
