Pages that link to "Item:Q1220945"

The following pages link to A necessary condition for the square of a graph to be Hamiltonian (Q1220945):

Displaying 6 items.

• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts (Q1236125) (← links)
• Maximal Hamiltonian cycles in squares of graphs (Q1255503) (← links)
• Hamiltonian squares of cacti (Q1255968) (← links)
• The square of a block is strongly path connected (Q1844686) (← links)
• (Q3903036) (← links)
• 1-(edge-)trail-connected square tree (Q5865710) (← links)