Pages that link to "Item:Q476308"
From MaRDI portal
The following pages link to Coloring graphs characterized by a forbidden subgraph (Q476308):
Displaying 25 items.
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms (Q1613477) (← links)
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
- Forbidden subgraphs of coloring graphs (Q1684531) (← links)
- Classifying \(k\)-edge colouring for \(H\)-free graphs (Q1739218) (← links)
- On the algorithmic aspects of strong subcoloring (Q1752633) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Near-complete multipartite graphs and forbidden induced subgraphs (Q1817577) (← links)
- The complexity of generalized graph colorings (Q1923585) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- Colorings of oriented planar graphs avoiding a monochromatic subgraph (Q2166215) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult (Q2498403) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Subdivision of the hierarchy of H-colorable graph classes by circulant graphs (Q3439166) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions (Q5090159) (← links)
- A new kind of graph coloring (Q5468865) (← links)
- Some cases of polynomial solvability for the edge colorability problem generated by forbidden 8-edge subcubic forests (Q5878618) (← links)
