Minimal Disconnected Cuts in Planar Graphs (Q2947884): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of the matching-cut problem for planar graphs and other graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the List Partition Problem for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding topological subgraphs is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disconnected cuts and separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing cut sets in a graph by the number of their components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractions of Planar Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Skew Partition Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in claw-free graphs and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of disconnected cut and \(2 K_2\)-partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small separators in linear time via treewidth reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding clique cut-sets / rank
 
Normal rank

Latest revision as of 19:41, 10 July 2024

scientific article
Language Label Description Also known as
English
Minimal Disconnected Cuts in Planar Graphs
scientific article

    Statements

    Minimal Disconnected Cuts in Planar Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2015
    0 references
    vertex cut
    0 references
    connectivity
    0 references
    planar graph
    0 references

    Identifiers

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