Abstract
Let ∑̃ n denote the nonorientable surface of nonorientable genus n. A graph G is irreducible for ∑̃ n if G does not embed in ∑̃ n but any proper subgraph does embed. Let I 3 ∑̃ n) denote the set of cubic irreducible graphs for ∑̃ n. This note proves Theorem. I 3 (∑̃ n) is finite for each n.
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.
