On minimal imperfect graphs without induced \(P_5\)
From MaRDI portal
Publication:1293187
DOI10.1016/S0166-218X(99)00012-8zbMath0936.05045OpenAlexW1986710194MaRDI QIDQ1293187
Vincent Barré, Jean-Luc Fouquet
Publication date: 8 May 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00012-8
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Related Items
An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs ⋮ Some results on maximum stable sets in certain \(P_{5}\)-free graphs ⋮ Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs ⋮ No odd pairs in minimal imperfect NP\({}_{5}\) graphs.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coloring perfect \((K_ 4\)-e)-free graphs
- Bull-free Berge graphs are perfect
- Murky graphs
- A new property of critical imperfect graphs and some consequences
- Two classes of perfect graphs
- The strong perfect graph conjecture for pan-free graphs
- Star-cutsets and perfect graphs
- Some properties of minimal imperfect graphs
- Graphical properties related to minimal imperfection
- Short-chorded and perfect graphs
- On the perfect graph conjecture
- New classes of Berge perfect graphs
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Chair-free Berge graphs are perfect
- Split-neighbourhood graphs and the strong perfect graph conjecture
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- A note on Hamiltonian circuits
- A characterization of perfect graphs
- On a property of the class of n-colorable graphs
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Perfect zero–one matrices
- The connectivity of minimal imperfect graphs
- Transitiv orientierbare Graphen
- A note on even pairs
- A note on even pairs
- On the strong perfect graph conjecture
