Abstract
Let G be the family of all c-connected ( c=4 or 5) polyhedral supergraphs G of a given connected planar graph H where the mimimum vertex degree of G is 5. Let R(H) denote the maximum face size of H. We have proved for all non-empty families G : In the case R(H)<c, every G∈ G has a subgraph isomorphic to H whose vertices have a degree in G which is restricted by a number q=q(H, G) . In the case R(H)⩾c, such a restriction does not exist if H has a vertex of degree ⩾5 or if H is 3-connected.
Sign-in/Register to access full text options 
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.
