Pages that link to "Item:Q4973236"

The following pages link to On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236):

Displaying 11 items.

• Vertex coloring of graphs with few obstructions (Q344868) (← links)
• Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• The complexity of the edge 3-colorability problem for graphs without two induced fragments each on at most six vertices (Q892049) (← links)
• An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
• Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789) (← links)
• The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
• Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
• Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
• A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)