Planar Graphs of Maximum Degree Six without 7-cycles are Class One

  • Danjun Huang
  • Weifan Wang
DOI: https://doi.org/10.37236/2589
Keywords: Planar graph, edge coloring, class one, cycle

Abstract

In this paper, we prove that every planar graph of maximum degree six without 7-cycles is class one.
Published
2012-08-09
How to Cite
Huang, D., & Wang, W. (2012). Planar Graphs of Maximum Degree Six without 7-cycles are Class One. The Electronic Journal of Combinatorics, 19(3), P17. https://doi.org/10.37236/2589
Issue
Volume 19, Issue 3 (2012)
Article Number
P17