Pages that link to "Item:Q4115165"
From MaRDI portal
The following pages link to The Planar Hamiltonian Circuit Problem is NP-Complete (Q4115165):
Displaying 27 items.
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
- (Q5075803) (← links)
- (Q5075806) (← links)
- Packing 1-plane Hamiltonian cycles in complete geometric graphs (Q5080782) (← links)
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
- (Q5088936) (← links)
- Approximation Algorithms for Facial Cycles in Planar Embeddings (Q5091033) (← links)
- (Q5092344) (← links)
- Hamiltonian Cycles and Subsets of Discounted Occupational Measures (Q5119853) (← links)
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- (Q5708487) (← links)
- An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726) (← links)
- On Finding Hamiltonian Cycles in Barnette Graphs (Q5880941) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)
- Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture (Q6055393) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- Optimizing concurrency under Scheduling by Edge Reversal (Q6087133) (← links)
- Traversability, reconfiguration, and reachability in the gadget framework (Q6090541) (← links)
- Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy (Q6114853) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
- Path eccentricity of graphs (Q6162021) (← links)
