Containment relations in split graphs (Q765349): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Contractions in Subclasses of Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractibility and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of induced minors and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On miniaturized problems in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contracting a Chordal Graph to a Split Graph or a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / 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: Contractions of Planar Graphs in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of graph contractions II: Two tough polynomially solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph contractions and induced minors / rank
 
Normal rank

Latest revision as of 00:50, 5 July 2024

scientific article
Language Label Description Also known as
English
Containment relations in split graphs
scientific article

    Statements

    Containment relations in split graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    0 references
    subgraph
    0 references
    minor
    0 references
    topological minor
    0 references
    contraction
    0 references
    graph containment problem
    0 references
    graph operations
    0 references
    edge deletions
    0 references
    edge contractions
    0 references
    vertex deletions
    0 references
    vertex dissolutions
    0 references
    0 references