Journal of Graph Theory, Volume 53

Volume 53, Number 1, 2006

• Maria Chudnovsky:
  Berge trigraphs. 1-55
  Electronic Edition (link) BibTeX
• Vojtech Rödl, M. H. Siggers:
  Color critical hypergraphs with many edges. 56-74
  Electronic Edition (link) BibTeX
• Tamás Mátrai:
  Covering the edges of a graph by three odd subgraphs. 77-82
  Electronic Edition (link) BibTeX

Volume 53, Number 2, October 2006

• Guantao Chen, Warren E. Shreve, Bing Wei:
  Hamiltonian graphs involving neighborhood unions. 83-100
  Electronic Edition (link) BibTeX
• Stefanie Gerke, Catherine S. Greenhill, Nicholas C. Wormald:
  The generalized acyclic edge chromatic number of random regular graphs. 101-125
  Electronic Edition (link) BibTeX
• Raphael Yuster:
  Mean Ramsey-Turán numbers. 126-134
  Electronic Edition (link) BibTeX
• Michael O. Albertson, Debra L. Boutin:
  Distinguishing geometric graphs. 135-150
  Electronic Edition (link) BibTeX
• Mario Lomelí, Gelasio Salazar:
  Nearly light cycles in embedded graphs and crossing-critical graphs. 151-156
  Electronic Edition (link) BibTeX
• Arthur H. Busch, Michael S. Jacobson, K. B. Reid:
  On arc-traceable tournaments. 157-166
  Electronic Edition (link) BibTeX
• David R. Wood:
  Vertex partitions of chordal graphs. 167-172
  Electronic Edition (link) BibTeX

Volume 53, Number 3, November 2006

• Xingxing Yu:
  Infinite paths in planar graphs IV, dividing cycles. 173-195
  Electronic Edition (link) BibTeX
• Noga Alon, Rados Radoicic, Benny Sudakov, Jan Vondrák:
  A Ramsey-type result for the hypercube. 196-208
  Electronic Edition (link) BibTeX
• Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
  Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms. 209-232
  Electronic Edition (link) BibTeX
• David Défossez:
  Clique-coloring some classes of odd-hole-free graphs. 233-249
  Electronic Edition (link) BibTeX
• Wilfried Imrich, Sandi Klavzar:
  Distinguishing Cartesian powers of graphs. 250-260
  Electronic Edition (link) BibTeX

Volume 53, Number 4, December 2006

• Carsten Thomassen:
  On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation. 261-269
  Electronic Edition (link) BibTeX
• Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan, Vincent R. Vatter:
  Maximal independent sets in graphs with at most r cycles. 270-282
  Electronic Edition (link) BibTeX
• Bruce E. Sagan, Vincent R. Vatter:
  Maximal and maximum independent sets in graphs with at most r cycles. 283-314
  Electronic Edition (link) BibTeX
• Stéphane Bessy, F. Havet, Etienne Birmelé:
  Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. 315-332
  Electronic Edition (link) BibTeX
• Jinfeng Feng, Hans-Erik Giesen, Yubao Guo, Gregory Gutin, Tommy R. Jensen, Arash Rafiey:
  Characterization of edge-colored complete graphs with properly colored Hamilton paths. 333-346
  Electronic Edition (link) BibTeX