A necessary condition for the square of a graph to be Hamiltonian

DOI10.1016/0095-8956(75)90078-7zbMath0315.05120OpenAlexW2062601399MaRDI QIDQ1220945

Arthur M. Hobbs, Herbert Fleischner

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90078-7

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (6)

Unnamed Item ⋮ In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts ⋮ Maximal Hamiltonian cycles in squares of graphs ⋮ Hamiltonian squares of cacti ⋮ The square of a block is strongly path connected ⋮ 1-(edge-)trail-connected square tree

Cites Work

• Unnamed Item
• The square of a block is vertex pancyclic
• On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
• The square of every two-connected graph is Hamiltonian
• Hamiltonian Total Graphs
• On a certain ordering of the vertices of a tree
• Trees with Hamiltonian square

This page was built for publication: A necessary condition for the square of a graph to be Hamiltonian