On the complexity of the k-chain subgraph cover problem

Authors:
Chang-Wu Yu;Gen-Huey Chen;Tze-Heng Ma
Affiliations:
Ming Hsin Institute of Technology and Commerce, Hsin-Chu, Taiwan, ROC;National Taiwan Univ., Taipei, Taiwan, ROC;Academia Sinica, Taipei, Taiwan, ROC
Venue:
Theoretical Computer Science
Year:
1998

Induced matchings in asteroidal triple-free graphs

Discrete Applied Mathematics - Special issue on stability in graphs and related topics
Note: The induced matching and chain subgraph cover problems for convex bipartite graphs

Theoretical Computer Science
New min-max theorems for weakly chordal and dually hordal graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
A constant factor approximation algorithm for boxicity of circular arc graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures

Hi-index	5.23