Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4

Mahdieh Hasheminezhad*, Brendan D. McKay

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    2 Citations (Scopus)

    Abstract

    We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are known as octahedrites, can all be obtained from an elementary family of starting graphs by repeatedly applying two expansion operations. This allows for construction of a linear time generator of all graphs in the class with at most a given order, up to isomorphism.

    Original languageEnglish
    Pages (from-to)123-136
    Number of pages14
    JournalDiscussiones Mathematicae - Graph Theory
    Volume30
    Issue number1
    DOIs
    Publication statusPublished - 2010

    Fingerprint

    Dive into the research topics of 'Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4'. Together they form a unique fingerprint.

    Cite this