Meyniel weakly triangulated graphs. I: Co-perfect orderability
From MaRDI portal
Publication:678852
DOI10.1016/S0166-218X(96)00008-XzbMath0878.05035MaRDI QIDQ678852
Publication date: 18 December 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
greedy algorithm; chromatic number; weakly triangulated graph; conjecture of Chvátal; pefectly orderable; perfect order
Related Items
Finding houses and holes in graphs, An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs, On a conjecture of Hoàng and Tu concerning perfectly orderable graphs, A new characterization of HH-free graphs, Coloring Artemis graphs
Cites Work
- Weakly triangulated graphs
- On the complexity of recognizing perfectly orderable graphs
- A charming class of perfectly orderable graphs
- On the perfect graph conjecture
- On the complexity of recognizing a class of perfectly orderable graphs
- Characterizations of totally balanced matrices
- Which line-graphs are perfectly orderable?
- On brittle graphs