Abstract
Lih et al. showed that every planar graph without 4-cycles or i-cycles for some i∈{5,6,7} is (3,1)-choosable. Dong and Xu showed that every toroidal graph without 4-cycles or 6-cycles is (3,1)-choosable. In this paper, we show that every toroidal graph without 4-cycles or i-cycles for some i∈{5,7} is also (3,1)-choosable.
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.
