Abstract
Let G = ( V(G), E(G )) be a connected graph. Denote by f min( G ) the minimum number of faces taken over all 2-cell embeddings of G into orientable surfaces. For every subset A of E(G ), let p(A ) (resp. i(A )) be the number of components of G/A = (V(G),E(G) – A ) with even (resp. odd) Betti number. Set y A ( G ) = p(A ) + 2 i(A )-| A ∩ E(G ). Using known results on the maximum genus and some matroid theoretical results, L. Nebesky showed that max A y A ( G ) = f min( G ). In this paper, we give another direct proof of this result where only graph-theoretical concepts are used.
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.
