Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
- 29 May 2008
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 57 (1) , 74-81
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Deciding k-Colorability of P 5-Free Graphs in Polynomial TimeAlgorithmica, 2008
- Extremal Graph Theory2005
- Coloration de graphes : fondements et applicationsRAIRO - Operations Research, 2003
- Weighted parameters in (P5, P5)-free graphsDiscrete Applied Mathematics, 1997
- Dominating cliques in P5-free graphsPeriodica Mathematica Hungarica, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Optimizing weakly triangulated graphsGraphs and Combinatorics, 1989
- Polynomial Algorithms for Perfect Graphs1984
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972