Perfectly orderable graphs are quasi-parity graphs: a short proof

DOI10.1016/0012-365X(88)90047-7zbMath0632.05049OpenAlexW2081404700MaRDI QIDQ1095159

Dominique de Werra, Alain Hertz

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90047-7

zbMATH Keywords

quasi-parity graphsperfectly orderable graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (8)

Path parity and perfection ⋮ On planar perfectly contractile graphs ⋮ A fast algorithm for coloring Meyniel graphs ⋮ Even pairs in claw-free perfect graphs ⋮ On the structure of bull-free perfect graphs ⋮ Counterexamples to three conjectures concerning perfect graphs ⋮ A class of perfectly contractile graphs ⋮ Perfectly contractile graphs

Cites Work

• New classes of perfect graphs
• A new property of critical imperfect graphs and some consequences
• Which line-graphs are perfectly orderable?

This page was built for publication: Perfectly orderable graphs are quasi-parity graphs: a short proof