The square of a block is Hamiltonian connected

DOI10.1016/0095-8956(74)90075-6zbMath0277.05129OpenAlexW2017108431MaRDI QIDQ1393413

S. F. Kapoor, Gary Chartrand, Arthur M. Hobbs, C. St. J. A. Nash-Williams, Heinz A. Jung

Publication date: 1974

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(74)90075-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (25)

Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem ⋮ Hamilton-connectivity of line graphs with application to their detour index ⋮ Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications ⋮ Connected even factors in the square of essentially 2-edge-connected graph ⋮ Graphs with cyclomatic number three having panconnected square ⋮ Dead ends on wreath products and lamplighter groups ⋮ Unnamed Item ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Unnamed Item ⋮ Disjoint path covers in cubes of connected graphs ⋮ A new proof of the theorem by Fleischner ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Graphs with cyclomatic number two having panconnected square ⋮ Some recent results in hamiltonian graphs ⋮ The square of a block is vertex pancyclic ⋮ Johnson graphs are panconnected ⋮ The entire graph of a bridgeless connected plane graph is Hamiltonian ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Various results on the toughness of graphs ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ On graphs whose square have strong Hamiltonian properties ⋮ The square of a block is strongly path connected ⋮ Unnamed Item ⋮ On \(k\)-path pancyclic graphs ⋮ Some remarks on the square graph of the hypercube

Cites Work

• Unnamed Item
• Hamilton connected graphs
• On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
• The square of every two-connected graph is Hamiltonian
• n-Hamiltonian graphs

This page was built for publication: The square of a block is Hamiltonian connected