Pages that link to "Item:Q1169818"

The following pages link to The edge Hamiltonian path problem is NP-complete (Q1169818):

Displaying 49 items.

• The constrained shortest path tour problem (Q342457) (← links)
• UNO is hard, even for a single player (Q389942) (← links)
• Gray codes with bounded weights (Q442379) (← links)
• Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
• Sequences of radius \(k\) for complete bipartite graphs (Q528554) (← links)
• Hamiltonian index is NP-complete (Q629366) (← links)
• Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
• How many conjectures can you stand? A survey (Q659764) (← links)
• A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
• Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
• A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
• Finding Hamiltonian cycles in \(\{\)quasi-claw, \(K_{1,5},K_{1,5} + e\}\)-free graphs with bounded Dilworth numbers (Q1025522) (← links)
• Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
• Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
• Finding Hamiltonian circuits in interval graphs (Q1066674) (← links)
• Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
• The edge Hamiltonian path problem is NP-complete for bipartite graphs (Q1210313) (← links)
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs (Q1297424) (← links)
• Claw-free graphs---a survey (Q1356695) (← links)
• A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430) (← links)
• Classification of de Bruijn-based labeled digraphs (Q1686053) (← links)
• The multi-stripe travelling salesman problem (Q1698268) (← links)
• On directed covering and domination problems (Q1735678) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
• Design of experiment for tuning parameters of an ant colony optimization method for the constrained shortest Hamiltonian path problem in the grid networks (Q2061347) (← links)
• Forbidden subgraphs for existences of (connected) 2-factors of a graph (Q2107755) (← links)
• Constrained shortest path tour problem: branch-and-price algorithm (Q2147106) (← links)
• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
• On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
• Hamiltonian paths in spanning subgraphs of line graphs (Q2400567) (← links)
• On Saito's conjecture and the Oberly-Sumner conjectures (Q2409500) (← links)
• Parameterized edge Hamiltonicity (Q2413968) (← links)
• Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)
• On computing the Hamiltonian index of graphs (Q2699968) (← links)
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs (Q2891038) (← links)
• Sequences of Radius k for Complete Bipartite Graphs (Q3181042) (← links)
• Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs (Q3439140) (← links)
• Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research (Q4609783) (← links)
• (Q4691817) (← 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)
• On Directed Covering and Domination Problems (Q5136265) (← links)
• Contracting to a longest path in H-free graphs (Q6065420) (← links)
• Constrained shortest path tour problem: models, valid inequalities, and Lagrangian heuristics (Q6070419) (← links)
• The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions (Q6087141) (← links)
• Connected proper interval graphs and the guard problem in spiral polygons (extended abstract) (Q6567668) (← links)
• Arbitrarily edge-partitionable graphs (Q6648283) (← links)