Abstract
Given an infinite leafless tree drawn on the plane, we ask whether or not one can add edges between the vertices of the tree obtaining a non-3-face-colorable graph. We formulate a condition conjectured to be necessary and sufficient for this to be possible. We prove that this condition is indeed necessary and sufficient for trees with maximal degree 3, and that it is sufficient for general trees. In particular, we prove that every infinite plane graph with a spanning binary tree is 3-face-colorable.
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.
