Pages that link to "Item:Q4291183"

The following pages link to On the Structure of Non-Hamiltonian Graphs I (Q4291183):

Displaying 3 items.

• Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360) (← links)
• On one extension of Dirac's theorem on Hamiltonicity (Q1630770) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)