On dart-free perfectly contractile graphs

DOI10.1016/j.tcs.2003.11.026zbMath1070.68122OpenAlexW2045335649MaRDI QIDQ1885896

Cláudia Linhares Sales, Frédéric Maffray

Publication date: 12 November 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.11.026

zbMATH Keywords

Perfect graphsDart-free graphsEven pairs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items (1)

Perfectly contractile graphs and quadratic toric rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of bull-free perfect graphs
• Which claw-free graphs are perfectly orderable?
• Perfectly contractile graphs
• Two classes of perfect graphs
• Recognizing claw-free perfect graphs
• Even pairs in claw-free perfect graphs
• Path parity and perfection
• On planar perfectly contractile graphs
• Normal hypergraphs and the perfect graph conjecture
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

This page was built for publication: On dart-free perfectly contractile graphs