Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 55
Volume 55, Number 1, May 2007
- Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott:
Maximum directed cuts in acyclic digraphs. 1-13 - Chin-Ann Soh:
The circular chromatic numbers of planar digraphs. 14-26 - David Coudert, Florian Huc, Jean-Sébastien Sereni:
Pathwidth of outerplanar graphs. 27-41 - Fedor V. Fomin
, Dimitrios M. Thilikos:
On self duality of pathwidth in polyhedral graph embeddings. 42-54 - Stefko Miklavic, Primoz Potocnik, Steve Wilson:
Overlap in consistent cycles. 55-71 - Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang:
The upper bound of the number of cycles in a 2-factor of a line graph. 72-82 - Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki:
Spanning trees with leaf distance at least four. 83-90
Volume 55, Number 2, June 2007
- Weiting Cao, Peter Hamburger:
Solution of fink & straight conjecture on path-perfect complete bipartite graphs. 91-111 - Robert E. L. Aldred, Bill Jackson:
Edge proximity conditions for extendability in cubic bipartite graphs. 112-120 - Zemin Jin, Xingxing Yu, Xiaoyan Zhang:
Contractible subgraphs in k-connected graphs. 121-136 - Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone colorings for graphs: Tree and path backbones. 137-152 - Camino Balbuena, T. Jiang, Yuqing Lin, Xavier Marcote, Mirka Miller:
A lower bound on the order of regular graphs with given girth pair. 153-163 - András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi:
Tripartite Ramsey numbers for paths. 164-174
Volume 55, Number 3, July 2007
- T. H. Marshall:
Homomorphism bounds for oriented planar graphs. 175-190 - Leif K. Jørgensen, Ken-ichi Kawarabayashi:
Extremal results for rooted minor problems. 191-207 - Dror Fidler, Raphael Yuster:
Remarks on the second neighborhood problem. 208-220 - Amine El Sahili, Mekkia Kouider:
About paths with two blocks. 221-226 - Martín Matamala:
Vertex partitions and maximum degenerate subgraphs. 227-232 - Jozef Sirán, Thomas W. Tucker:
Characterization of graphs which admit vertex-transitive embeddings. 233-248 - André Raspaud, Xuding Zhu:
List circular coloring of trees and cycles. 249-265
Volume 55, Number 4, August 2007
- Zhi-Zhong Chen:
New bounds on the edge number of a k-map graph. 267-290 - Florent Balacheff:
Volume entropy, weighted girths and stable balls on graphs. 291-305 - Alexander K. Kelmans:
Packing k-edge trees in graphs of restricted vertex degrees. 306-324 - Anders Yeo:
Relationships between total domination, order, size, and maximum degree of graphs. 325-337 - Carol T. Zamfirescu, Tudor Zamfirescu:
A planar hypohamiltonian graph with 48 vertices. 338-342 - Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Tutte sets in graphs I: Maximal tutte sets and D-graphs. 343-358
a service of 
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-04-22 20:03 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:
