On triangulating planar graphs under the four-connectivity constraint (Q5056168): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Therese C. Biedl / rank
Normal rank
 
Property / author
 
Property / author: Therese C. Biedl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-58218-5_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1589741320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangular duals of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / 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: Rectilinear planar layouts and bipolar orientations of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to visibility representations of planar graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:07, 31 July 2024

scientific article; zbMATH DE number 7631688
Language Label Description Also known as
English
On triangulating planar graphs under the four-connectivity constraint
scientific article; zbMATH DE number 7631688

    Statements

    Identifiers

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