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 50 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: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← 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)
- On 3-colouring of graphs with short faces and bounded maximum vertex degree (Q2030141) (← links)
- Role coloring bipartite graphs (Q2081494) (← links)
- Parameterized complexity of list coloring and max coloring (Q2097212) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- On the Nash number and the diminishing Grundy number of a graph (Q2127607) (← links)
- An intractability result for the vertex 3-colourability problem (Q2136878) (← links)
- Non-existence of stable social groups in information-driven networks (Q2158297) (← links)
- Regular pattern-free coloring (Q2172395) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- \(b\)-continuity and partial Grundy coloring of graphs with large girth (Q2185922) (← links)
- Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732) (← links)
- Stable matching with uncertain linear preferences (Q2309477) (← 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)
- Topology optimization design of 3D electrothermomechanical actuators by using GPU as a co-processor (Q2417560) (← 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)
- Feedback vertex set on Hamiltonian graphs (Q2672436) (← links)
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← 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)
- Identifying influential nodes in complex networks: A node information dimension approach (Q4565974) (← links)
- On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
- (Q5002765) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Finer Tight Bounds for Coloring on Clique-Width (Q5130905) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- (Q5883509) (← links)