default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 54
Volume 54, Number 1, January 2007
- András Gyárfás, Jenö Lehel, Richard H. Schelp:
Finding a monochromatic subgraph or a rainbow path. 1-12 - Jaroslav Nesetril
, Yared Nigussie:
Density of universal classes of series-parallel graphs. 13-23 - Zhongyuan Che, Karen L. Collins:
Retracts of box products with odd-angulated factors. 24-40 - Maria Chudnovsky, Alexandra Ovetsky:
Coloring quasi-line graphs. 41-50 - Ji-Ming Guo:
The kth Laplacian eigenvalue of a tree. 51-57 - Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel:
A new upper bound on the cyclic chromatic number. 58-72 - Noga Alon, Eyal Lubetzky:
Independent sets in tensor graph powers. 73-87 - Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden:
Erratum to: "Star factorizations of graph products". 88-89
Volume 54, Number 2, February 2007
- Weifan Wang:
Total chromatic number of planar graphs with maximum degree ten. 91-102 - Jorge L. Arocha, Joaquín Tey:
The size of minimum 3-trees. 103-114 - Joel Foisy:
More intrinsically knotted graphs. 115-124 - C. Paul Bonnington, R. Bruce Richter, Mark E. Watkins:
Between ends and fibers. 125-153 - Bill Jackson, Brigitte Servatius, Herman Servatius:
The 2-dimensional rigidity of certain families of graphs. 154-166 - Jacob Fox, Kathy Lin:
The minimum degree of Ramsey-minimal graphs. 167-177
Volume 54, Number 3, March 2007
- Anthony J. W. Hilton, Peter D. Johnson Jr.:
List multicolorings of graphs with measurable sets. 179-193 - Hong Wang:
Pentagons and cycle coverings. 194-208 - Daniel Král, Ladislav Stacho:
Closure for the property of having a hamiltonian prism. 209-220 - Saieed Akbari, Alireza Alipour:
Multicolored trees in complete graphs. 221-232 - Penny E. Haxell, Ben Seamone, Jacques Verstraëte:
Independent dominating sets and hamiltonian cycles. 233-244 - Mickaël Montassier, André Raspaud, Weifan Wang:
Acyclic 5-choosability of planar graphs without small cycles. 245-260 - Andrew Thomason, Peter Wagner:
Complete graphs with no rainbow path. 261-266
Volume 54, Number 4, April 2007
- Sreyash Kenkre, Sundar Vishwanathan:
A bound on the chromatic number using the longest odd cycle length. 267-276 - Tomoki Yamashita:
A degree sum condition for longest cycles in 3-connected graphs. 277-283 - Zhao Zhang, Yirong Zheng, Aygul Mamut:
Nowhere-zero flows in tensor product of graphs. 284-292 - Sheshayya A. Choudum, T. Karthick, M. A. Shalu:
Perfect coloring and linearly chi-bound P6-free graphs. 293-306 - Prosenjit Bose, Jurek Czyzowicz, Zhicheng Gao, Pat Morin, David R. Wood:
Simultaneous diagonal flips in plane triangulations. 307-330 - Maya Jakobine Stein:
Forcing highly connected subgraphs. 331-349 - Erfang Shan, Liying Kang, Michael A. Henning:
Erratum to: "A linear vizing-like relation relating the size and total domination number of a graph". 350-353
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-11-22 19:43 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:
