Abstract
We prove a reduction theorem for prime (simple) graphs in Cunningham’s sense. Roughly speaking this theorem says that every prime (simple) graph of ordern>5 “contains” a smaller prime graph of ordern−1. As an application we give a polynomial algorithm for recognizing circle graphs.
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.
