Total coloring of planar graphs without adjacent chordal 5-cycles

Authors

  • Tian, Jingjing
  • Wang, Huijuan
  • Wu, Jianliang

Abstract

In this paper, it is proved that if G is a planar graph with maximum degree Δ ≥ 8 and without adjacent chordal 5-cycles, then G is (Δ + 1)-total-colorable.

Published

2013-06-09

How to Cite

Tian, Jingjing, Wang, Huijuan, & Wu, Jianliang. (2013). Total coloring of planar graphs without adjacent chordal 5-cycles. Utilitas Mathematica, 91. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/955

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.