Classes of perfect graphs
- 6 October 2006
- journal article
- Published by Elsevier BV in Discrete Mathematics
- Vol. 306 (19-20), 2529-2571
- https://doi.org/10.1016/j.disc.2006.05.021
Abstract
No abstract availableKeywords
This publication has 90 references indexed in Scilit:
- An O(n2) algorithm to color Meyniel graphsDiscrete Mathematics, 2001
- Recognizing i-triangulated graphs in O(mn) timeInformation Processing Letters, 2000
- On the extension of bipartite to parity graphsDiscrete Applied Mathematics, 1999
- Preperfect graphsCombinatorica, 1993
- Skeletal graphs — a new class of perfect graphsDiscrete Mathematics, 1989
- Paw-free graphsInformation Processing Letters, 1988
- A New Property of Critical Imperfect Graphs and some ConsequencesEuropean Journal of Combinatorics, 1987
- Trivially perfect graphsDiscrete Mathematics, 1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A max {m,n} algorithm for determining the graph H from its line graph GInformation Processing Letters, 1973