The perfection and recognition of bull-reducible Berge graphs
From MaRDI portal
Publication:4680732
DOI10.1051/ita:2005009zbMath1063.05055OpenAlexW1976007362MaRDI QIDQ4680732
Sulamita Klein, Hazel Everett, Bruce A. Reed, Celina M. Herrera de Figueiredo
Publication date: 7 June 2005
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2005__39_1_145_0
Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the structure of bull-free perfect graphs
- Topics on perfect graphs
- The strong perfect graph theorem
- Bull-free Berge graphs are perfect
- Star-cutsets and perfect graphs
- Recognizing bull-free perfect graphs
- Discs in unbreakable graphs
- Recognizing Berge graphs
- Normal hypergraphs and the perfect graph conjecture
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- On the structure of bull-free perfect graphs. II: The weakly chordal case
- Bull-free weakly chordal perfectly orderable graphs