A fast algorithm for coloring Meyniel graphs
- 1 December 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 50 (2) , 231-240
- https://doi.org/10.1016/0095-8956(90)90078-e
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Perfectly contractile graphsJournal of Combinatorial Theory, Series B, 1990
- Perfectly orderable graphs are quasi-parity graphs: a short proofDiscrete Mathematics, 1988
- A New Property of Critical Imperfect Graphs and some ConsequencesEuropean Journal of Combinatorics, 1987
- On a conjecture of MeynielJournal of Combinatorial Theory, Series B, 1987
- A note on strong perfectness of graphsMathematical Programming, 1985
- Meyniel graphs are strongly perfectJournal of Combinatorial Theory, Series B, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- On the perfect graph conjectureDiscrete Mathematics, 1976