default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 62
Volume 62, Number 1, September 2009
- Hikoe Enomoto, Mirko Hornák
:
A general upper bound for the cyclic chromatic number of 3-connected plane graphs. 1-25 - Mariusz Grech:
Direct products of automorphism groups of graphs. 26-36 - Bill Jackson, Kiyoshi Yoshimoto:
Spanning even subgraphs of 3-edge-connected graphs. 37-47 - Ewa Drgas-Burchardt:
On uniqueness of a general factorization of graph properties. 48-64 - Noga Alon, Uri Stav:
Stability-type results for hereditary properties. 65-83 - Stanislav Jendrol', Jozef Miskuf, Roman Soták, Erika Skrabul'áková:
Rainbow faces in edge-colored plane graphs. 84-99 - Galen E. Turner III:
Cycle-minors and subdivisions of wheels. 100-108
Volume 62, Number 2, October 2009
- Paul S. Bonsma:
The complexity of the matching-cut problem for planar graphs and other graph classes. 109-126 - Louis Esperet, Mickaël Montassier, Xuding Zhu:
Adapted list coloring of planar graphs. 127-138 - David Défossez:
Complexity of clique-coloring odd-hole-free graphs. 139-156 - Peter Dankelmann, Simon Mukwembi, Henda C. Swart:
Average distance and vertex-connectivity. 157-177 - Hong Wang:
Packing two copies of a sparse graph into a graph with restrained maximum degree. 178-187 - Matthias Kriesell:
Edge disjoint Steiner trees in graphs without large bridges. 188-198
- Paul K. Stockmeyer:
Erratum to: "The falsity of the reconstruction conjecture for tournaments". 199-200
Volume 62, Number 3, November 2009
- Yuehua Bu, Daniel W. Cranston, Mickaël Montassier, André Raspaud, Weifan Wang:
Star coloring of sparse graphs. 201-219 - Marcelo Henriques de Carvalho, C. H. C. Little:
Circuit decompositions of join-covered graphs. 220-233 - Oleg V. Borodin, Anna O. Ivanova:
Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable. 234-240 - Václav Koubek, Vojtech Rödl, Benjamin Shemmer:
On graphs with a given endomorphism monoid. 241-262 - Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Critical graphs for subpancyclicity of 3-connected claw-free graphs. 263-278 - Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita:
On relative length of longest paths and cycles. 279-291
Volume 62, Number 4, December 2009
- Hilda Assiyatun, William Duckworth:
Small maximal matchings of random cubic graphs. 293-323 - Yusheng Li:
The multi-color Ramsey number of an odd cycle. 324-328 - Mariusz Grech, Andrzej Kisielewicz:
Totally symmetric colored graphs. 329-345 - Wei Meng, Shengjia Li, Yubao Guo, Gaokui Xu:
A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic. 346-361 - Vladimir Nikiforov:
Stability for large forbidden subgraphs. 362-368 - Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs. 369-384
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-01-09 19:34 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:
