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.
- Restricted cycle factors and arc-decompositions of digraphs (Q2354716) (← links)
- All-shortest-path 2-interval routing is NP-complete (Q2380872) (← 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)
- On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph (Q2393062) (← links)
- A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
- Construction sequences and certifying 3-connectivity (Q2428654) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← 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)
- 2-edge-Hamiltonian-connectedness of 4-connected plane graphs (Q2509769) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Complexity and stochastic evolution of dyadic networks (Q2567162) (← links)
- Decycling with a matching (Q2628271) (← links)
- On temporal graph exploration (Q2662667) (← links)
- Computing the largest bond and the maximum connected cut of a graph (Q2663713) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- Eulerian walks in temporal graphs (Q2689257) (← links)
- Can local optimality be used for efficient data reduction? (Q2692734) (← links)
- Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
- On computing the Hamiltonian index of graphs (Q2699968) (← links)
- Mine ’Em All: A Note on Mining All Graphs (Q2827475) (← links)
- Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Matching and spanning in certain planar graphs (Q3043190) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Some natural decision problems in automatic graphs (Q3570167) (← links)
- On the computational complexity of centers locating in a graph (Q3902477) (← links)
- The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- The <i>st</i>-bond polytope on series-parallel graphs (Q4611490) (← links)
- On the Minimum Number of Hamiltonian Cycles in Regular Graphs (Q4646702) (← links)
- (Q4691777) (← links)
- (Q4691817) (← links)
- Aligned Drawings of Planar Graphs (Q4961753) (← links)
- NP–hard problems naturally arising in knot theory (Q4997304) (← links)
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem (Q5011679) (← links)
- Feasible Bases for a Polytope Related to the Hamilton Cycle Problem (Q5026442) (← links)
- On Computing the Hamiltonian Index of Graphs (Q5042256) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
