Trees with Hamiltonian square

DOI10.1112/S0025579300008494zbMath0221.05052OpenAlexW2028535821MaRDI QIDQ5625198

Allen J. Schwenk, Frank Harary

Publication date: 1971

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0025579300008494

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Related Items

Remarks on Hamiltonian properties of powers of digraphs ⋮ Long paths and toughness of \(k\)-trees and chordal planar graphs ⋮ Clique tree generalization and new subclasses of chordal graphs ⋮ Claw-free graphs---a survey ⋮ On the Hamiltonicity exponent of directed cacti ⋮ Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars ⋮ Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ Characterization of co-blockers for simple perfect matchings in a convex geometric graph ⋮ The color cost of a caterpillar ⋮ On total unimodularity of edge-edge adjacency matrices ⋮ Cycles in squares of trees without generalized claws ⋮ The maximum linear arrangement problem for trees under projectivity and planarity ⋮ Graphs with cyclomatic number three having panconnected square ⋮ One node fault tolerance for caterpillars and starlike trees ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Proof of Harary's conjecture on the reconstruction of trees ⋮ Disjoint path covers in cubes of connected graphs ⋮ The circumference of the square of a connected graph ⋮ Spanning connectivity of the power of a graph and Hamilton-connected index of a graph ⋮ Trestles in the squares of graphs ⋮ Hydras: directed hypergraphs and Horn formulas ⋮ Transversals in Trees ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ A necessary condition for the square of a graph to be Hamiltonian ⋮ Hamiltonian squares of cacti ⋮ Clique-perfectness of complements of line graphs ⋮ Graphs with 1-hamiltonian-connected cubes ⋮ The number of caterpillars ⋮ On graphs whose square have strong Hamiltonian properties ⋮ Separating subgraphs in k-trees: Cables and caterpillars ⋮ New bounds on the barycenter heuristic for bipartite graph drawing. ⋮ Interior graphs of maximal outerplane graphs ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots

Cites Work

• On the Cube of a Graph