The following pages link to (Q4272117):
Displaying 9 items.
- On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579) (← links)
- Minimal antichains in well-founded quasi-orders with an application to tournaments (Q1850501) (← links)
- Boundary classes of graphs for the dominating set problem (Q1877644) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- Independent sets in graphs without subtrees with many leaves (Q3186851) (← links)
- Forbidden ordered subgraph vs. forbidden subgraph characterizations of graph classes (Q4229261) (← links)
- New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths (Q4558286) (← links)
- Polynomial algorithm for finding the largest independent sets in graphs without forks (Q4936659) (← links)
- (Q6078549) (← links)
