2-connecting outerplanar graphs without blowing up the pathwidth (Q744095): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3138887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PATHWIDTH AND LAYERED DRAWINGS OF TREES / 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: Augmenting the connectivity of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Outerplanar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the pathwidth of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545841 / rank
 
Normal rank

Latest revision as of 03:27, 9 July 2024

scientific article
Language Label Description Also known as
English
2-connecting outerplanar graphs without blowing up the pathwidth
scientific article

    Statements

    2-connecting outerplanar graphs without blowing up the pathwidth (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    pathwidth
    0 references
    outerplanar graph
    0 references
    2-vertex-connected
    0 references
    0 references