Parameterizing cut sets in a graph by the number of their components (Q653326): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cutsets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / 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: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding<i>H</i>-partitions efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: List Partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering graphs with few complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: The computational complexity of disconnected cut and \(2 K_2\)-partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth reduction for constrained separation and bipartization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding clique cut-sets / rank
 
Normal rank

Latest revision as of 20:13, 4 July 2024

scientific article
Language Label Description Also known as
English
Parameterizing cut sets in a graph by the number of their components
scientific article

    Statements

    Parameterizing cut sets in a graph by the number of their components (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2012
    0 references
    0 references
    disconnected cut
    0 references
    0 references