Perfectly contractile graphs
- 1 December 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 50 (2) , 222-230
- https://doi.org/10.1016/0095-8956(90)90077-d
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A fast algorithm for coloring Meyniel graphsJournal of Combinatorial Theory, Series B, 1990
- Perfectly orderable graphs are quasi-parity graphs: a short proofDiscrete Mathematics, 1988
- On a conjecture of MeynielJournal of Combinatorial Theory, Series B, 1987
- Star-cutsets and perfect graphsJournal of Combinatorial Theory, Series B, 1985
- The Graphs Whose Odd Cycles have at Least two ChordsPublished by Elsevier ,1984
- Parity GraphsPublished by Elsevier ,1984
- Perfectly Ordered GraphsPublished by Elsevier ,1984
- Strongly Perfect GraphsPublished by Elsevier ,1984
- Algorithms on clique separable graphsDiscrete Mathematics, 1977
- Uniquely colorable graphsJournal of Combinatorial Theory, 1969