Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- 1 June 1972
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 1 (2), 180-187
- https://doi.org/10.1137/0201013
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961