Abstract
We study the list 2-distance coloring of a graph G, and its maximum average degree, denoted mad (G). For Δ(G) = 5, we proved that [Formula: see text], [Formula: see text], [Formula: see text] and ch 2(G) ≤ 11 if mad (G) < 3 respectively, where ch 2(G) is the list 2-distance chromatic number.
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.
