The maximum k-colorable subgraph problem for chordal graphs
- 1 January 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 24 (2), 133-137
- https://doi.org/10.1016/0020-0190(87)90107-4
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Node-Deletion Problems on Bipartite GraphsSIAM Journal on Computing, 1981
- On chain and antichain families of a partially ordered setJournal of Combinatorial Theory, Series B, 1980
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976
- Some partitions associated with a partially ordered setJournal of Combinatorial Theory, Series A, 1976
- The structure of sperner k-familiesJournal of Combinatorial Theory, Series A, 1976
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974