Some sufficient conditions for a planar graph of maximum degree six to be Class 1

@article{Bu2006SomeSC,
  title={Some sufficient conditions for a planar graph of maximum degree six to be Class 1},
  author={Yuehua Bu and Wei-Fan Wang},
  journal={Discrete Mathematics},
  year={2006},
  volume={306},
  pages={1440-1445}
}
Let G be a planar graph of maximum degree 6. In this paper we prove that if G does not contain either a 6-cycle, or a 4-cycle with a chord, or a 5and 6-cycle with a chord, then ′(G) = 6, where ′(G) denotes the chromatic index of G. © 2006 Elsevier B.V. All rights reserved. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

A note on graphs of class I

  • G. Zhou
  • Discrete Math. 262
  • 2003
Highly Influential
4 Excerpts

Some 4-valent

  • S. A. Choudum
  • 3-connected, planar, almost pancyclic graphs…
  • 1977
1 Excerpt

Critical graphs with given chromatic class

  • V. G. Vizing
  • Diskret. Analiz. 5
  • 1965
2 Excerpts

Critical graphs with given chromatic class , Diskret

  • V. G. Vizing
  • Analiz .
  • 1964

On an estimate of the chromatic index of a p-graph

  • V. G. Vizing
  • Diskret. Analiz. 3
  • 1964
1 Excerpt

Similar Papers

Loading similar papers…