Pages that link to "Item:Q1331931"

The following pages link to Complexity of the hamiltonian cycle in regular graph problem (Q1331931):

Displaying 21 items.

• Global cycle properties of locally isometric graphs (Q266915) (← links)
• Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs (Q266958) (← links)
• The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
• Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Hamilton cycles in sparse locally connected graphs (Q1730246) (← links)
• The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs (Q2026347) (← links)
• Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
• On Hamiltonicity of regular graphs with bounded second neighborhoods (Q2143049) (← links)
• On NP-hard graph properties characterized by the spectrum (Q2197466) (← links)
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case (Q2402374) (← links)
• Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices (Q2457012) (← links)
• Shifted de Bruijn Graphs (Q3460465) (← links)
• (Q4601890) (← links)
• (Q4691817) (← links)
• 3-colorability of 4-regular hamiltonian graphs (Q4797925) (← links)
• Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
• Global cycle properties in graphs with large minimum clustering coefficient (Q5236152) (← links)
• Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
• On 3-degree 4-chordal graphs (Q6174132) (← links)
• Induced tree covering and the generalized Yutsis property (Q6547951) (← links)