Perfectly contractile graphs
DOI10.1016/0095-8956(90)90077-DzbMATH Open0727.05024OpenAlexW2085919819MaRDI QIDQ803147FDOQ803147
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90077-d
Recommendations
- A class of perfectly contractile graphs
- On planar perfectly contractile graphs
- Perfectly contractile diamond-free graphs
- Algorithms for Perfectly Contractile Graphs
- Contractible bonds in graphs
- Contractible bonds in graphs
- On dart-free perfectly contractile graphs
- scientific article; zbMATH DE number 4120196
- Contractible edges in triangle-free graphs
- On contracting graphs to fixed pattern graphs
perfect graphsperfectly contractile graphsperfectly orderable graphsclique separable graphsk-switching of a graph
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms on clique separable graphs
- Star-cutsets and perfect graphs
- Uniquely colorable graphs
- Topics on perfect graphs
- Title not available (Why is that?)
- On a conjecture of Meyniel
- A fast algorithm for coloring Meyniel graphs
- Title not available (Why is that?)
- A new property of critical imperfect graphs and some consequences
- Perfectly orderable graphs are quasi-parity graphs: a short proof
- Posets having a unique decomposition into the minimum number of antichains
- Title not available (Why is that?)
Cited In (22)
- On planar perfectly contractile graphs
- A class of perfectly contractile graphs
- Kempe equivalence of colourings of cubic graphs
- Graph transformations preserving the stability number
- Even pairs in claw-free perfect graphs
- On dart-free perfectly contractile graphs
- Path parity and perfection
- Contracted graphs of kinematic chains with multiple joints
- A fast algorithm for coloring Meyniel graphs
- Title not available (Why is that?)
- Introduction to reconfiguration
- Graph properties and hypergraph colourings
- Coloring Artemis graphs
- Even pairs in square-free Berge graphs
- Graph transformations preserving the stability number
- Classes of perfect graphs
- Perfectly contractile graphs and quadratic toric rings
- Title not available (Why is that?)
- Kempe equivalence of colourings of cubic graphs
- On the structure of bull-free perfect graphs
- A generalization of perfect graphs?i-perfect graphs
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs
This page was built for publication: Perfectly contractile graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803147)
