Pages that link to "Item:Q556851"
From MaRDI portal
The following pages link to Some new hereditary classes where graph coloring remains NP-hard (Q556851):
Displaying 17 items.
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- The coloring problem for classes with two small obstructions (Q479257) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Adaptive linear combination of heuristic orderings in constructing examination timetables (Q2255942) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- List coloring in the absence of two subgraphs (Q2636800) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← 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)
- List Coloring in the Absence of a Linear Forest (Q3104770) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
