Splitting plane graphs to outerplanarity (Q6091165): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An FPT algorithm for bipartite vertex splitting / 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: The book thickness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangulating \(k\)-outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Covering Vertices by Faces in a Planar Graph / 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: Approximation of pathwidth of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(13k\)-kernel for planar feedback vertex set via region decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds For Induced Forests in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the planar split thickness of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPLITTING NUMBER is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar rectilinear drawings of outerplanar graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching among intervals and compact routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The toroidal splitting number of the complete graph \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splitting number of the complete graph in the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splitting number of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splitting number of complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum size of feedback vertex sets of planar graphs of girth at least five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three ways to cover a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the edge-length ratio of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound on the feedback vertex sets in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining a planar graph by vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face covers and the genus problem for apex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classification of some edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarizing graphs and their drawings by vertex splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: VERTEX SPLITTING IN DAGS AND APPLICATIONS TO PARTIAL SCAN DESIGNS AND LOSSY CIRCUITS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connecting face hitting sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On double and multiple interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Latest revision as of 14:24, 19 August 2024

scientific article; zbMATH DE number 7770294
Language Label Description Also known as
English
Splitting plane graphs to outerplanarity
scientific article; zbMATH DE number 7770294

    Statements

    Splitting plane graphs to outerplanarity (English)
    0 references
    0 references
    0 references
    0 references
    24 November 2023
    0 references
    vertex splitting
    0 references
    outerplanarity
    0 references
    feedback vertex set
    0 references
    0 references
    0 references
    0 references

    Identifiers