default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 49
Volume 49, Number 1, May 2005
- Keith E. Mellinger, Dhruv Mubayi:
Constructions of bipartite graphs from finite geometries. 1-10 - Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin
:
Factorizations and characterizations of induced-hereditary and compositive properties. 11-27 - Péter Komjáth, Saharon Shelah:
Finite subgraphs of uncountably chromatic graphs. 28-38 - András Gyárfás, Alice Hubenko:
Semistrong edge coloring of graphs. 39-47 - Robert E. L. Aldred, Derek A. Holton, John Sheehan:
2-factors with prescribed and proscribed edges. 48-58 - Jozef Jirásek:
Arc reversal in nonhamiltonian circulant oriented graphs. 59-68 - Jaroslav Nesetril, Nicholas C. Wormald:
The acyclic edge chromatic number of a random d-regular graph is d + 1. 69-74 - Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. 75-91
Volume 49, Number 2, June 2005
- Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang:
Heavy cycles passing through some specified vertices in weighted graphs. 93-103 - Liming Xiong, Zdenek Ryjácek, Hajo Broersma:
On stability of the hamiltonian index under contractions and closures. 104-115 - Lowell W. Beineke, Jean E. Dunbar, Marietjie Frick:
Detour-saturated graphs. 116-134 - Mei Lu, Huiqing Liu, Feng Tian:
Two sufficient conditions for dominating cycles. 135-150 - Jacques Verstraëte:
Unavoidable cycle lengths in graphs. 151-167 - Vladimir Nikiforov, Cecil C. Rousseau:
A note on Ramsey numbers for books. 168-176
Volume 49, Number 3, July 2005
- Daniel Král, Jirí Sgall:
Coloring graphs from lists with bounded size of their union. 177-186 - Benny Sudakov, Tibor Szabó, Van H. Vu:
A generalization of Turán's theorem. 187-195 - Hong-Jian Lai, Xiangwen Li, Hoifung Poon:
Nowhere zero 4-flow in regular matroids. 196-204 - Daniela Kühn, Deryk Osthus:
Spanning triangulations in graphs. 205-233 - Rong Luo, Cun-Quan Zhang:
Edge-face chromatic number and edge chromatic number of simple plane graphs. 234-256
Volume 49, Number 4, August 2005
- Frédéric Meunier:
A topological lower bound for the circular chromatic number of Schrijver graphs. 257-261 - Florian Pfender:
Hamiltonicity and forbidden subgraphs in 4-connected graphs. 262-272 - Stefan Felsner, William T. Trotter:
Posets and planar graphs. 273-284 - Michael A. Henning:
A linear Vizing-like relation relating the size and total domination number of a graph. 285-290 - Andrew McLennan:
The Erdös-Sós Conjecture for trees of diameter four. 291-301 - Sandi Klavzar, Iztok Peterin:
Characterizing subgraphs of Hamming graphs. 302-312 - Dániel Marx:
NP-completeness of list coloring and precoloring extension on the edges of planar graphs. 313-324 - Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3. 325-335
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-07 23:38 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:
