Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles

Authors

  • Tan, Xiang
  • Chen, Hong-Yu

Abstract

Let G be a planar graph with maximum degree Δ. It is proved that if Δ ≥ 6 and G does not contain intersecting 4-cycles and intersecting 5-cycles, then the total chromatic number is Δ+1.

Published

2017-09-09

How to Cite

Tan, Xiang, & Chen, Hong-Yu. (2017). Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles. Utilitas Mathematica, 104. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1196

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.