On triangulating planar graphs under the four-connectivity constraint (Q1386769)

From MaRDI portal
Revision as of 03:10, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On triangulating planar graphs under the four-connectivity constraint
scientific article

    Statements

    title
    On triangulating planar graphs under the four-connectivity constraint (English)
    0 references
    author
    Goos Kant
    0 references
    Therese C. Biedl
    0 references
    Michael Kaufmann
    0 references
    published in
    Algorithmica
    0 references
    publication date
    11 October 1998
    0 references
    zbMATH Keywords
    triangulation of planar graphs under constraints
    0 references

    Identifiers

    DOI
    10.1007/PL00009182
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C10
    0 references
    05C85
    0 references
    68Q25
    0 references
    68U05
    0 references
    zbMATH DE Number
    1156897
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1386769&oldid=26194966"
    Powered by MediaWiki