default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 71
Volume 71, Number 1, September 2012
- Reza Zamani, Douglas B. West:
Spanning Cycles Through Specified Edges in Bipartite Graphs. 1-17 - Daniel W. Cranston
, Anja Pruchnewski, Zsolt Tuza, Margit Voigt:
List Colorings of K5-Minor-Free Graphs With Special List Assignments. 18-30 - Henry A. Kierstead, Alexandr V. Kostochka:
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. 31-48 - Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Excluding Induced Subdivisions of the Bull and Related Graphs. 49-68 - Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen:
New Ore-Type Conditions for H-Linked Graphs. 69-77 - Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray:
New Bounds on the Grundy Number of Products of Graphs. 78-88 - Salman Ghazal:
Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star. 89-94 - Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek:
A Characterization of b-Perfect Graphs. 95-122
Volume 71, Number 2, October 2012
- Xinmin Hou, Cun-Quan Zhang:
A note on shortest cycle covers of cubic graphs. 123-127 - Ken-ichi Kawarabayashi, John Maharry:
Minors in large almost-5-connected non-planar graphs. 128-141 - Choongbum Lee, Wojciech Samotij:
Pancyclic subgraphs of random graphs. 142-158 - Michael D. Barrus, Douglas B. West:
The A4-structure of a graph. 159-175 - Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam:
The structure of graphs with a vital linkage of order 2. 176-181 - Richard C. Brewster, Daryl Funk:
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs. 182-191 - Linyuan Lu, Xing Peng:
On Meyniel's conjecture of the cop number. 192-205 - L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow connection number and connected dominating sets. 206-218 - Douglas Bauer, Edward F. Schmeichel:
Binding Number, Minimum Degree, and Cycle Structure in Graphs. 219-228
Volume 71, Number 3, November 2012
- Aaron Hill, Steve Wilson:
Four Constructions of Highly Symmetric Tetravalent Graphs. 229-244 - Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach:
The potential of greed for independence. 245-259 - Qiaoping Guo, Shengjia Li, Ruijuan Li:
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices. 260-277 - András Gyárfás, Gábor Simonyi, Ágnes Tóth:
Gallai colorings and domination in multipartite digraphs. 278-292 - Fabrício Siqueira Benevides:
A multipartite Ramsey number for odd cycles. 293-316 - Eli Berger, Irith Ben-Arroyo Hartman:
A unified approach to known and unknown cases of Berge's conjecture. 317-330 - Michael Molloy, Giovanna Thron:
An asymptotically tight bound on the adaptable chromatic number. 331-351
Volume 71, Number 4, December 2012
- Lars Døvling Andersen, Edita Mácajová, Ján Mazák:
Optimal acyclic edge-coloring of cubic graphs. 353-364 - Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge Coloring of Triangle-Free Planar Graphs. 365-385 - Stephen G. Hartke, Tyler Seacrest:
Graphic Sequences Have Realizations Containing Bisections of Large Degree. 386-401 - Jin-Xin Zhou:
Tetravalent vertex-transitive graphs of order 4p. 402-415 - Michael Ferrara, Michael S. Jacobson, Kevin G. Milans, Craig Tennenhouse, Paul S. Wenger:
Saturation numbers for families of graph subdivisions. 416-434 - Michael Ferrara, Timothy Morris, Paul S. Wenger:
Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs. 435-447
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-12-19 22:13 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:
