default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 66
Volume 66, Number 1, January 2011
- Oleg V. Borodin, Alexei N. Glebov:
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable. 1-31 - Landon Rabern:
On hitting all maximum cliques with an independent set. 32-37 - Frédéric Havet, Stanislav Jendrol'
, Roman Soták, Erika Skrabul'áková:
Facial non-repetitive edge-coloring of plane graphs. 38-48 - Daniel Gonçalves:
On vertex partitions and some minor-monotone graph parameters. 49-56 - Gábor N. Sárközy:
Monochromatic cycle partitions of edge-colored graphs. 57-64 - Gábor Simonyi, Gábor Tardos:
On directed local chromatic number, shift graphs, and Borsuk-like graphs. 65-82 - Tracy Holt, Yared Nigussie:
Short proofs for two theorems of Chien, Hell and Zhu. 83-88
Volume 66, Number 2, February 2011
- Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Ricardo Strausz:
On the pseudoachromatic index of the complete graph. 89-97 - Douglas R. Woodall:
The independence number of an edge-chromatic critical graph. 98-103 - Xiao-Dong Zhang:
Vertex degrees and doubly stochastic graph matrices. 104-114 - Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald:
Geodesics and almost geodesic cycles in random regular graphs. 115-136 - Zdenek Ryjácek, Petr Vrána:
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs. 137-151 - Zdenek Ryjácek, Petr Vrána:
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs. 152-173
Volume 66, Number 3, March 2011
- Xia Zhang, Guizhen Liu:
Equitable edge-colorings of simple graphs. 175-197 - Tsai-Lien Wong, Xuding Zhu:
Total weight choosability of graphs. 198-212 - N. R. Aravind, C. R. Subramanian:
Bounds on vertex colorings with restrictions on the union of color classes. 213-234 - Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos:
Strengthening Erdös-Pósa property for minor-closed graph classes. 235-240 - Matt DeVos, Robert Sámal:
High-girth cubic graphs are homomorphic to the Clebsch graph. 241-259
Volume 66, Number 4, April 2011
- Béla Bollobás, Alex D. Scott:
Intersections of graphs. 261-282 - Frank Göring, Christoph Helmberg, Markus Wappler:
The rotational dimension of a graph. 283-302 - Mariusz Grech:
The graphical complexity of direct products of permutation groups. 303-318 - Wayne Goddard, Jeremy Lyle:
Dense graphs with small clique number. 319-331 - Jean-Sébastien Sereni, Matej Stehlík:
Edge-face coloring of plane graphs with maximum degree nine. 332-346
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 2026-06-15 01:08 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:
