Pages that link to "Item:Q4115165"

The following pages link to The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165):

Displayed 50 items.

• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) ‎ (← links)
• Computing simple circuits from a set of line segments (Q583232) ‎ (← links)
• Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems (Q679069) ‎ (← links)
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) ‎ (← links)
• Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) ‎ (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) ‎ (← links)
• Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) ‎ (← links)
• Connectivity of plane triangulations (Q911313) ‎ (← links)
• Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) ‎ (← links)
• Recent results on well-balanced orientations (Q955324) ‎ (← links)
• Finding Hamiltonian circuits in proper interval graphs (Q1050117) ‎ (← links)
• Complete problems for space bounded subclasses of NP (Q1064779) ‎ (← links)
• Finding Hamiltonian circuits in interval graphs (Q1066674) ‎ (← links)
• Games against nature (Q1069296) ‎ (← links)
• Hamiltonian circuits in interval graph generalizations (Q1092669) ‎ (← links)
• On mapping processes to processors in distributed systems (Q1095652) ‎ (← links)
• The complexity of facets resolved (Q1109565) ‎ (← links)
• A note on the traveling salesman problem (Q1116903) ‎ (← links)
• On the complexity of scheduling jobs on dedicated resources to minimize set-up costs (Q1152708) ‎ (← links)
• Context-free grammars as a tool for describing polynomial-time subclasses of hard problems (Q1164998) ‎ (← links)
• The edge Hamiltonian path problem is NP-complete (Q1169818) ‎ (← links)
• Optimal covering of cacti by vertex-disjoint paths (Q1178689) ‎ (← links)
• NP-completeness and degree restricted spanning trees (Q1199472) ‎ (← links)
• Some results on visibility graphs (Q1201816) ‎ (← links)
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855) ‎ (← links)
• Embeddings of graphs (Q1313840) ‎ (← links)
• Satisfiability of co-nested formulas (Q1323332) ‎ (← links)
• 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)
• 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)
• Pancyclicity and NP-completeness in planar graphs (Q1962068) ‎ (← links)
• Hardness and approximation results for black hole search in arbitrary networks (Q2382674) ‎ (← links)
• Each maximal planar graph with exactly two separating triangles is Hamiltonian (Q2383540) ‎ (← links)
• Good triangulations yield good tours (Q2384914) ‎ (← links)
• Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices (Q2457012) ‎ (← links)
• Exact algorithms for the Hamiltonian cycle problem in planar graphs (Q2494820) ‎ (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) ‎ (← links)
• Complexity and stochastic evolution of dyadic networks (Q2567162) ‎ (← links)