Abstract
We prove that every triangle-free planar graph of order n and size m has an induced linear forest with at least 9n−2m11 vertices, and thus at least 5n+811 vertices. Furthermore, we show that there are triangle-free planar graphs on n vertices whose largest induced linear forest has order ⌈n2⌉+1.
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.
