Total colorings of planar graphs with maximum degree at least 8

@inproceedings{Lan2009TotalCO,
  title={Total colorings of planar graphs with maximum degree at least 8},
  author={Shen Lan and WANG YingQian},
  year={2009}
}
Planar graphs with maximum degree Δ 8 and without 5or 6-cycles with chords are proved to be (Δ + 1)-totally-colorable. 

From This Paper

Figures, tables, and topics from this paper.
10 Citations
9 References
Similar Papers

References

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

Some unsolved problems in graph theory

  • G VizingV
  • Graph Theory
  • 2008

Graph Theory. Berlin: Springer, 2008 2 Vizing V G. Some unsolved problems in graph theory

  • J ABondy, S R.MurtyU
  • Russian Math Surveys,
  • 1968

On total chromatic number of planar graphs without 4-cycles

  • Y QWang, M LShangguan, Q. Li
  • Sci China Ser A
  • 1965

Similar Papers

Loading similar papers…