Two classes of perfect graphs
From MaRDI portal
Publication:1112847
DOI10.1016/0095-8956(91)90078-XzbMath0661.05055MaRDI QIDQ1112847
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
bipartite graphsclique numberstrong perfect graph conjectureBerge graphclaw-free Berge graphsdartdart-free Berge graphsdart-free perfect graphsdiamond-free Berge graphsGallai-perfect graphsline-graphs of bipartite graphs
Related Items (17)
On dart-free perfectly contractile graphs ⋮ Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Infinite \(\Phi\)-periodic graphs ⋮ Chair-free Berge graphs are perfect ⋮ Gallai graphs and anti-Gallai graphs ⋮ Some properties of minimal imperfect graphs ⋮ Gallai and anti-Gallai graph operators ⋮ Classes of perfect graphs ⋮ EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS ⋮ On the relation of strong triadic closure and cluster deletion ⋮ Your rugby mates don't need to know your colleagues: triadic closure with edge colors ⋮ On minimal imperfect graphs without induced \(P_5\) ⋮ On an edge partition and root graphs of some classes of line graphs ⋮ A transformation which preserves the clique number ⋮ Quasi-star-cutsets and some consequences ⋮ A survey of the studies on Gallai and anti-Gallai graphs ⋮ Mortality of iterated Gallai graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
- Topics on perfect graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- Bull-free Berge graphs are perfect
- A new property of critical imperfect graphs and some consequences
- Paw-free graphs
- Star-cutsets and perfect graphs
- Graphical properties related to minimal imperfection
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- Normal hypergraphs and the perfect graph conjecture
- How To Color Claw-Free Perfect Graphs
- Transitiv orientierbare Graphen
This page was built for publication: Two classes of perfect graphs