Planar graphs without cycles of specific lengths

  • Authors:
  • G. Fijavž;M. Juvan;B. Mohar;R. Škrekovski

  • Affiliations:
  • Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia;Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia;Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia;Department of Mathematics, University of Ljubljana, Jadranska 19, 1111 Ljubljana, Slovenia

  • Venue:
  • European Journal of Combinatorics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that planar graphs without 5-cycles are also 3-degenerate. In this paper it is shown, more surprisingly, that the same holds for planar graphs without 6-cycles.