On triangulating \(k\)-outerplanar graphs (Q479051): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W2028766875 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1310.1845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangulating planar graphs under the four-connectivity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing planar 3-trees with given face areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating planar graphs while minimizing the maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank

Latest revision as of 09:27, 9 July 2024

scientific article
Language Label Description Also known as
English
On triangulating \(k\)-outerplanar graphs
scientific article

    Statements

    Identifiers