Tree-width and circumference of graphs

  • Authors:

  • Etienne Birmele

  • Affiliations:

  • Lapcs, Université Claude Bernard Lyon I, France

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove that every graph of circumference k has tree-width at most k - 1 and that this bound is best possible. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 24–25, 2003