Abstract
Giving a planar graph G, let <TEX>$x^'_l(G)$</TEX> and <TEX>$x^{''}_l(G)$</TEX> denote the list edge chromatic number and list total chromatic number of G respectively. It is proved that if a planar graph G without 6-cycles with chord, then <TEX>$x^'_l(G){\leq}{\Delta}(G)+1$</TEX> and <TEX>$x^{''}_l(G){\leq}{\Delta}(G)+2$</TEX> where <TEX>${\Delta}(G){\geq}6$</TEX>.
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.
