Abstract
Let G be a planar graph without adjacent 3-cycles, that is, two cycles of length 3 are not incident with a common edge. In this paper, it is proved that the total coloring conjecture is true for G ; moreover, if Δ ( G ) ≥ 9 , then the total chromatic number χ ″ ( G ) of G is Δ ( G ) + 1 . Some other related results are obtained, too.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
