Pages that link to "Item:Q4115165"
From MaRDI portal
The following pages link to The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165):
Displaying 50 items.
- Complexity of the hamiltonian cycle in regular graph problem (Q1331931) (← links)
- Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763) (← links)
- On problems with short certificates (Q1338895) (← links)
- Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete (Q1341680) (← links)
- The complexity of recognizing tough cubic graphs (Q1372728) (← links)
- On finding two-connected subgraphs in planar graphs (Q1376267) (← links)
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. (Q1401394) (← links)
- The complexity of the locally connected spanning tree problem (Q1408813) (← links)
- Visibility representations of boxes in 2.5 dimensions (Q1615673) (← links)
- The parity Hamiltonian cycle problem (Q1690220) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- Tree-based unrooted phylogenetic networks (Q1742650) (← links)
- Circuit and bond polytopes on series-parallel graphs (Q1751117) (← links)
- Path partition for graphs with special blocks (Q1765521) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs (Q1838978) (← links)
- Face covers and the genus problem for apex graphs (Q1850536) (← links)
- Disconnected 2-factors in planar cubic bridgeless graphs (Q1850589) (← links)
- The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs (Q1893154) (← links)
- Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs (Q1920760) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Pancyclicity and NP-completeness in planar graphs (Q1962068) (← links)
- Counting substrate cycles in topologically restricted metabolic networks (Q2011645) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs (Q2093879) (← links)
- Hamiltonian cycle curves in the space of discounted occupational measures (Q2095221) (← links)
- On the dominating (induced) cycles of iterated line graphs (Q2104921) (← links)
- Two Hamiltonian cycles (Q2113347) (← links)
- Königsberg sightseeing: Eulerian walks in temporal graphs (Q2115887) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Hamiltonian problems in directed graphs with simple row patterns (Q2143132) (← links)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- StreamTable: an area proportional visualization for tables with flowing streams (Q2154088) (← links)
- Nested locally Hamiltonian graphs and the Oberly-Sumner conjecture (Q2158203) (← links)
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) (Q2182087) (← links)
- Existence and hardness of conveyor belts (Q2209897) (← links)
- Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs (Q2223450) (← links)
- Distance-two colourings of Barnette graphs (Q2225415) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
- A new upper bound for the traveling salesman problem in cubic graphs (Q2250536) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- Nontrivial path covers of graphs: existence, minimization and maximization (Q2292153) (← links)
- Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
- On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
- Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs (Q2308511) (← links)
- Edge-outer graph embedding and the complexity of the DNA reporter strand problem (Q2315018) (← links)
- Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
