The story of perfectly orderable graphs

DOI10.1007/S00373-007-0708-1MaRDI QIDQ2373439zbMATH OpenOpenAlexFDO

Authors Ryan Hayward

Publication date 19 July 2007

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

Full work available at URL https://doi.org/10.1007/s00373-007-0708-1

zbMATH Keywords

ChvátalPerfect orderPerfectly orderable graph

Mathematics Subject Classification ID

Perfect graphs (05C17)

Cites work

• A characterization of perfect graphs
• Edmonds polytopes and a hierarchy of combinatorial problems
• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3168327 (Why is no real title available?)
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3891425 (Why is no real title available?)
• Incidence matrices and interval graphs
• Maximum matching and a polyhedron with 0,1-vertices
• Normal hypergraphs and the perfect graph conjecture
• On certain polytopes associated with graphs
• On rigid circuit graphs
• Perfectly orderable graphs: A survey
• The ellipsoid method and its consequences in combinatorial optimization
• The strong perfect graph theorem
• Topics on perfect graphs

Cited in

(1)

• Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)

This page was built for publication: The story of perfectly orderable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373439)