Triangulating planar graphs while minimizing the maximum degree (Q5056146): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59568017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to draw a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Depth-First-Search Characterization of Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Smallest Augmentation to Biconnect a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest Augmentations to Biconnect a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Representations of Graphs / rank
 
Normal rank

Latest revision as of 03:06, 31 July 2024

scientific article; zbMATH DE number 7631662
Language Label Description Also known as
English
Triangulating planar graphs while minimizing the maximum degree
scientific article; zbMATH DE number 7631662

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references