Abstract
A connected bipartite graph is called elementary (or normal) if its every edge is contained in some perfect matching. In rho classification of coronoids due to Cyvin et al., normal coronoids are divided into two types: regular and half essentially disconnected. A coronoid is called regular if it can be generated from a single hexagon by a series of normal additions of hexagons (modes L., L. or L.) plus corona condensations of hexagons of modes L. or A.. Chen and Zhang (1997) gave a complete characterization: A coronoid is regular if and only if it has a perfect matching M such that the boundaries of non-hexagon faces are all M-alternating cycles. In this article, a general concept for the regular addition of an allowed face is proposed and the above result is extended to a plane elementary bipartite graph some specified faces of which are forbidden by applying recently developed matching theory. As its corollary, we give an equivalent definition of regular coronoids as a special ear decomposition.
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.
