Pages that link to "Item:Q1043996"

The following pages link to On graphs whose square have strong Hamiltonian properties (Q1043996):

Displaying 15 items.

• A short proof of the versatile version of Fleischner's theorem (Q383756) (← links)
• Graphs with cyclomatic number two having panconnected square (Q534050) (← links)
• Hamiltonian cycles in the square of a graph (Q648391) (← links)
• A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
• Revisiting the Hamiltonian theme in the square of a block: the general case (Q1630691) (← links)
• Revisiting the Hamiltonian theme in the square of a block: the case of \(DT\)-graphs (Q1691217) (← links)
• Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph (Q1817578) (← links)
• Forbidden subgraphs for a graph to have a Hamiltonian path square (Q2227983) (← links)
• Connected even factors in the square of essentially 2-edge-connected graph (Q2401428) (← links)
• Single-source three-disjoint path covers in cubes of connected graphs (Q2444763) (← links)
• Disjoint path covers in cubes of connected graphs (Q2449141) (← links)
• (Q3717087) (← links)
• Graphs with cyclomatic number three having panconnected square (Q4595257) (← links)
• Graphs with cyclomatic number three having panconnected square, II (Q4956192) (← links)
• The most general structure of graphs with Hamiltonian or Hamiltonian connected square (Q6080167) (← links)