Edge contractions in subclasses of chordal graphs (Q423902): 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: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / 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: Containment relations in split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Subgraph Isomorphism on Interval and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Contracting Graphs to Fixed Pattern Graphs / 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: 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: Threshold graphs and related topics / 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: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Comparability Graph of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on "The Comparability Graph of a Tree" / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-threshold graphs / rank
 
Normal rank

Latest revision as of 06:28, 5 July 2024

scientific article
Language Label Description Also known as
English
Edge contractions in subclasses of chordal graphs
scientific article

    Statements

    Edge contractions in subclasses of chordal graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 May 2012
    0 references
    graph modification algorithms
    0 references
    edge contractions
    0 references
    chordal graphs
    0 references
    induced subgraph isomorphism
    0 references

    Identifiers