2005
DOI: 10.1016/j.disc.2005.10.005
|View full text |Cite
|
Sign up to set email alerts
|

Generation of simple quadrangulations of the sphere

Abstract: A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that every face is bounded by a walk of 4 edges. We consider the following classes of simple quadrangulations: arbitrary, minimum degree 3, 3-connected, and 3-connected without non-facial 4-cycles. In each case, we show how the class can be generated by starting with some basic graphs in the class and applying a sequence of local modifications. The duals of our algorithms generate classes of quartic (4-regular) planar g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
122
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 78 publications
(123 citation statements)
references
References 13 publications
(14 reference statements)
1
122
0
Order By: Relevance
“…Face contractions on a graph in class Q 2 . As in [4], triangles incident to some vertices indicate that one or more edges may occur at that position around the vertex. Here p 1 and p 3 are sinks; analogous face contractions, each removing a source from the graph, can be performed by switching the colors.…”
Section: Combinatorial Partmentioning
confidence: 99%
See 3 more Smart Citations
“…Face contractions on a graph in class Q 2 . As in [4], triangles incident to some vertices indicate that one or more edges may occur at that position around the vertex. Here p 1 and p 3 are sinks; analogous face contractions, each removing a source from the graph, can be performed by switching the colors.…”
Section: Combinatorial Partmentioning
confidence: 99%
“…As in [8], we denote by a quadrangulation a finite planar undirected multigraph on the 2-sphere in which each face is bounded by a closed walk of length 4 (cf. [1,4]). A multigraph contains no loops but may have multiple (parallel) edges, and it is usually permitted that the boundary of a face may contain a vertex or an edge of the graph more than once (e.g.…”
Section: Combinatorial Partmentioning
confidence: 99%
See 2 more Smart Citations
“…Theorem 1.1 (Brinkmann et al [2]). Any K 3 -irreducible quadrangulation of the sphere is isomorphic to a pseudo double wheel.…”
Section: Introductionmentioning
confidence: 99%