A graph is perfect if the chromatic number of each induced subgraph \(H\) of \(G\) equals the size of the largest clique in \(H\). A graph \(G\) is called strongly perfect if each induced subgraph \(H\) of \(G\) has a vertex coloring \(\{C_i: i\in I\}\) such that some clique of \(H\) intersects all \(C_i\). It has been conjectured that a perfect graph with no infinite independent set is strongly perfect. This paper proves the conjecture for chordal graphs (in which every circuit of length \(\geq 4\) has a chord) and their complements.
Recommendations
- scientific article; zbMATH DE number 3889565
- Super strongly perfect graphs
- A class of strongly perfect graphs
- The strong perfect graph theorem
- The strong perfect graph theorem
- scientific article; zbMATH DE number 1789914
- Some classes of strongly perfect graphs
- scientific article; zbMATH DE number 733851
- Structure of super strongly perfect graphs
- On the strong perfect graph conjecture
Cites work
Cited in
(10)- A note on perfect graphs
- Strongly maximal antichains in posets
- scientific article; zbMATH DE number 426323 (Why is no real title available?)
- scientific article; zbMATH DE number 3884201 (Why is no real title available?)
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 165141 (Why is no real title available?)
- A new characterization of trivially perfect graphs
- Structure of super strongly perfect graphs
- On the strong perfect graph conjecture
- The Lovász-Cherkassky theorem in infinite graphs
This page was built for publication: Strongly perfect infinite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895072)
