The following pages link to Colouring diamond-free graphs (Q2402373):
Displaying 19 items.
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
- Clique-width and well-quasi-ordering of triangle-free graph classes (Q5918202) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
- A class of graphs with large rankwidth (Q6080165) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
- Tree pivot-minors and linear rank-width (Q6621185) (← links)
