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
Volume 55,
Number 4,
August 2007
Last update Tue Feb 14 04:20:36 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
