Pages that link to "Item:Q2136878"
From MaRDI portal
The following pages link to An intractability result for the vertex 3-colourability problem (Q2136878):
Displaying 9 items.
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385) (← links)
- On 3-colouring of graphs with short faces and bounded maximum vertex degree (Q2030141) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- Constructive generation of very hard 3-colorability instances (Q2467358) (← links)
- Strict colourings of STS(\(3v\))s and uncolourable BSTS(\(3v\))s (Q2569933) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
- Deciding 3-colourability in less than O(1.415n) steps (Q6143975) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
