The following pages link to (Q5387674):
Displayed 25 items.
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Labelled induced subgraphs and well-quasi-ordering (Q890007) (← links)
- Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Triangle-free graphs with no six-vertex induced path (Q1637133) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
- (Q5111290) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)