The following pages link to Chuan-Min Lee (Q410659):
Displaying 20 items.
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Variations of \(Y\)-dominating functions on graphs (Q941347) (← links)
- Signed and minus clique-transversal functions on graphs (Q976135) (← links)
- On the complexity of signed and minus total domination in graphs (Q990954) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- New upper bounds on feedback vertex numbers in butterflies (Q2390267) (← links)
- Variations of maximum-clique transversal sets on graphs (Q2430591) (← links)
- Kernels in planar digraphs (Q2485283) (← links)
- Distance-hereditary graphs are clique-perfect (Q2489948) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- (Q2828875) (← links)
- (Q2906273) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- (Q3119298) (← links)
- (Q3166442) (← links)
- Trivially-Perfect Width (Q3651555) (← links)
- (Q4414505) (← links)
- (Q4448744) (← links)
- (Q5243986) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902528) (← links)
