Algorithms on clique separable graphs
- 1 January 1977
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 19 (2) , 159-165
- https://doi.org/10.1016/0012-365x(77)90030-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961