Abstract
We consider the graph degree sequences such that every realisation is a polyhedron. It turns out that there are exactly eight of them. All of these are unigraphic, in the sense that each is realised by exactly one polyhedron. This is a revisitation of a Theorem of Rao about sequences that are realised by only planar graphs.Our proof yields additional geometrical insight on this problem. Moreover, our proof is constructive: for each graph degree sequence that is not forcibly polyhedral, we construct a non-polyhedral realisation.
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.
