Trees with Hamiltonian square

DOI10.1112/S0025579300008494MaRDI QIDQ5625198zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• On the Cube of a Graph

Cited in

(36)

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

This page was built for publication: Trees with Hamiltonian square

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5625198)