Perfectly contractile graphs
From MaRDI portal
Publication:803147
DOI10.1016/0095-8956(90)90077-DzbMath0727.05024OpenAlexW2085919819MaRDI QIDQ803147
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
perfect graphsperfectly orderable graphsperfectly contractile graphsclique separable graphsk-switching of a graph
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (19)
On dart-free perfectly contractile graphs ⋮ Even pairs in square-free Berge graphs ⋮ Path parity and perfection ⋮ On planar perfectly contractile graphs ⋮ A fast algorithm for coloring Meyniel graphs ⋮ Even pairs in claw-free perfect graphs ⋮ Perfectly contractile graphs and quadratic toric rings ⋮ Classes of perfect graphs ⋮ Unnamed Item ⋮ Kempe equivalence of colourings of cubic graphs ⋮ On a conjecture of Mohar concerning Kempe equivalence of regular graphs ⋮ Graph properties and hypergraph colourings ⋮ On the structure of bull-free perfect graphs ⋮ Graph transformations preserving the stability number ⋮ Graph transformations preserving the stability number ⋮ Kempe equivalence of colourings of cubic graphs ⋮ Coloring Artemis graphs ⋮ Introduction to reconfiguration ⋮ A class of perfectly contractile graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topics on perfect graphs
- Perfectly orderable graphs are quasi-parity graphs: a short proof
- On a conjecture of Meyniel
- A new property of critical imperfect graphs and some consequences
- A fast algorithm for coloring Meyniel graphs
- Star-cutsets and perfect graphs
- Algorithms on clique separable graphs
- Posets having a unique decomposition into the minimum number of antichains
- Uniquely colorable graphs
This page was built for publication: Perfectly contractile graphs
