Perfectly contractile graphs

DOI10.1016/0095-8956(90)90077-DzbMATH Open0727.05024OpenAlexW2085919819MaRDI QIDQ803147FDOQ803147

Authors Marc E. Bertschi 

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

zbMATH Keywords

perfect graphsperfectly contractile graphsperfectly orderable graphsclique separable graphsk-switching of a graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)

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

Cites work

• scientific article; zbMATH DE number 3889564 (Why is no real title available?)
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3904622 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3214398 (Why is no real title available?)
• A fast algorithm for coloring Meyniel graphs
• A new property of critical imperfect graphs and some consequences
• Algorithms on clique separable graphs
• On a conjecture of Meyniel
• Perfectly orderable graphs are quasi-parity graphs: a short proof
• Posets having a unique decomposition into the minimum number of antichains
• Star-cutsets and perfect graphs
• Topics on perfect graphs
• Uniquely colorable graphs

Cited in

(22)

• Graph properties and hypergraph colourings
• Graph transformations preserving the stability number
• Graph transformations preserving the stability number
• A fast algorithm for coloring Meyniel graphs
• Kempe equivalence of almost bipartite graphs
• scientific article; zbMATH DE number 4120196 (Why is no real title available?)
• A generalization of perfect graphs?i-perfect graphs
• On planar perfectly contractile graphs
• Kempe equivalence of colourings of cubic graphs
• On the structure of bull-free perfect graphs
• Even pairs in claw-free perfect graphs
• Coloring Artemis graphs
• On a conjecture of Mohar concerning Kempe equivalence of regular graphs
• On dart-free perfectly contractile graphs
• Even pairs in square-free Berge graphs
• Introduction to reconfiguration
• A class of perfectly contractile graphs
• Perfectly contractile graphs and quadratic toric rings
• Classes of perfect graphs
• Kempe equivalence of colourings of cubic graphs
• Contracted graphs of kinematic chains with multiple joints
• Path parity and perfection

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)