Pages that link to "Item:Q479257"
From MaRDI portal
The following pages link to The coloring problem for classes with two small obstructions (Q479257):
Displayed 15 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← 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)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
- Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)