The story of perfectly orderable graphs
From MaRDI portal
Publication:2373439
DOI10.1007/s00373-007-0708-1zbMath1119.05048OpenAlexW2098734456MaRDI QIDQ2373439
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
Related Items (1)
Cites Work
- On rigid circuit graphs
- Topics on perfect graphs
- The strong perfect graph theorem
- The ellipsoid method and its consequences in combinatorial optimization
- On certain polytopes associated with graphs
- Incidence matrices and interval graphs
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Edmonds polytopes and a hierarchy of combinatorial problems
- Maximum matching and a polyhedron with 0,1-vertices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The story of perfectly orderable graphs