Abstract
Let G be a planar graph without 5-cycles or without 6-cycles. In this paper, we prove that if G is connected and δ ( G ) ≥ 2 , then there exists an edge x y ∈ E ( G ) such that d ( x ) + d ( y ) ≤ 9 , or there is a 2-alternating cycle. By using the above result, we obtain that (1) its linear 2-arboricity l a 2 ( G ) ≤ ⌈ Δ ( G ) + 1 2 ⌉ + 6 , (2) its list total chromatic number is Δ ( G ) + 1 if Δ ( G ) ≥ 8 , and (3) its list edge chromatic number is Δ ( G ) if Δ ( G ) ≥ 8 .
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.
