Abstract
A $$k$$ -total-coloring of a graph $$G$$ is a coloring of vertex set and edge set using $$k$$ colors such that no two adjacent or incident elements receive the same color. In this paper, we prove that if $$G$$ is a planar graph with maximum $$\Delta \ge 8$$ and every 6-cycle of $$G$$ contains at most one chord or any chordal 6-cycles are not adjacent, then $$G$$ has a $$(\Delta +1)$$ -total-coloring.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Bulletin of the Malaysian Mathematical Sciences Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.