On planar perfectly contractile graphs

DOI10.1007/BF03352994zbMath0872.05038OpenAlexW1990396700MaRDI QIDQ1359374

Frédéric Maffray, Cláudia Linhares Sales, Bruce A. Reed

Publication date: 19 September 1997

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03352994

zbMATH Keywords

planar graphsperfect graphseven pairperfectly contractile graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

On dart-free perfectly contractile graphs ⋮ Path parity and perfection ⋮ Even pairs in claw-free perfect graphs ⋮ Perfectly contractile graphs and quadratic toric rings ⋮ A class of perfectly contractile graphs

Cites Work

• Unnamed Item
• Perfectly contractile graphs
• Coloring planar perfect graphs by decomposition
• Perfectly orderable graphs are quasi-parity graphs: a short proof
• A new property of critical imperfect graphs and some consequences
• Planar graphs: Theory and algorithms
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

This page was built for publication: On planar perfectly contractile graphs