On planar perfectly contractile graphs
From MaRDI portal
Publication:1359374
DOI10.1007/BF03352994zbMath0872.05038MaRDI QIDQ1359374
Cláudia Linhares Sales, Frédéric Maffray, Bruce A. Reed
Publication date: 19 September 1997
Published in: Graphs and Combinatorics (Search for Journal in Brave)
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Even pairs in claw-free perfect graphs, Path parity and perfection, On dart-free perfectly contractile graphs, 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