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.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Euclidean movement minimization (Q306076) (← links)
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- UNO is hard, even for a single player (Q389942) (← links)
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits (Q442349) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Spanning trees with nonseparating paths (Q501078) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Hamiltonian index is NP-complete (Q629366) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems (Q679069) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Zen puzzle garden is NP-complete (Q763503) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- Cyclability in graph classes (Q833007) (← 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)
- Interdiction problems on planar graphs (Q897609) (← links)
- Split Euler tours in 4-regular planar graphs (Q907827) (← links)
- Connectivity of plane triangulations (Q911313) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Recent results on well-balanced orientations (Q955324) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← 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)
