Abstract

AbstractA triangulation (resp., a quadrangulation) on a surface is a map of a loopless graph (possibly with multiple edges) on with each face bounded by a closed walk of length 3 (resp., 4). It is easy to see that every triangulation on any surface has a spanning quadrangulation. Kündgen and Thomassen proved that every even triangulation (ie, each vertex has even degree) on the torus has a spanning nonbipartite quadrangulation, and that if has sufficiently large edge width, then also has a bipartite one. In this paper, we prove that an even triangulation on the torus admits a spanning bipartite quadrangulation if and only if does not have as a subgraph, and moreover, we give some other results for the problem.

Full Text
Paper version not known

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 call

Disclaimer: 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.