Pages that link to "Item:Q1146685"
From MaRDI portal
The following pages link to Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete (Q1146685):
Displayed 22 items.
- Quantum graph homomorphisms via operator systems (Q254876) (← links)
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- A topological lower bound for the chromatic number of a special family of graphs (Q1686007) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Dominating set based exact algorithms for \(3\)-coloring (Q1944084) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- The computational complexity of the backbone coloring problem for planar graphs with connected backbones (Q2341776) (← links)
- On the computational complexity of defining sets (Q2387433) (← links)
- The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- On the Complexity of the Minimum Independent Set Partition Problem (Q3196378) (← links)