Abstract
In this article we describe a recursive structure for the class of 4-connected triangulations or – equivalently – cyclically 4-connected plane cubic graphs.
Highlights
A recursive structure for a class C of graphs is a base set B ⊂ C of initial graphs together with a set of operations on graphs that transform a graph in C to another graph in C so that each graph in C can be constructed from a graph in B by a sequence of these operations.c b This work is licensed under http://creativecommons.org/licenses/by/3.0/Ars Math
In this article we describe a recursive structure for the class of 4-connected triangulations or – equivalently – cyclically 4-connected plane cubic graphs
The operations necessary to construct all 4-connected triangulations are the same as the ones used in [4] to construct all triangulations with minimum degree 4 – except for the operation inducing separating triangles
Summary
A recursive structure for a class C of graphs is a base set B ⊂ C of initial graphs together with a set of operations on graphs that transform a graph in C to another graph in C so that each graph in C can be constructed from a graph in B by a sequence of these operations.c b This work is licensed under http://creativecommons.org/licenses/by/3.0/Ars Math. Abstract In this article we describe a recursive structure for the class of 4-connected triangulations or – equivalently – cyclically 4-connected plane cubic graphs.
Sign-in/Register to view highlights & summary 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.
