In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
From MaRDI portal
Publication:1236125
DOI10.1007/BF01305995zbMath0353.05043OpenAlexW1989780696MaRDI QIDQ1236125
Publication date: 1976
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/177773
Related Items (23)
Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ More aspects of arbitrarily partitionable graphs ⋮ Connected even factors in the square of essentially 2-edge-connected graph ⋮ A short proof of the versatile version of Fleischner's theorem ⋮ Cycles in squares of trees without generalized claws ⋮ The most general structure of graphs with Hamiltonian or Hamiltonian connected square ⋮ Graphs with cyclomatic number three having panconnected square ⋮ Bipanconnectivity of faulty hypercubes with minimum degree ⋮ Unnamed Item ⋮ A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Unnamed Item ⋮ A best possible result for the square of a 2-block to be Hamiltonian ⋮ Disjoint path covers in cubes of connected graphs ⋮ A new proof of the theorem by Fleischner ⋮ The circumference of the square of a connected graph ⋮ Graphs with cyclomatic number two having panconnected square ⋮ Johnson graphs are panconnected ⋮ Graphs with cyclomatic number three having panconnected square, II ⋮ Extending cycles in graphs ⋮ On graphs whose square have strong Hamiltonian properties ⋮ Powers of connected graphs and hamiltonicity ⋮ Some remarks on the square graph of the hypercube
Cites Work
This page was built for publication: In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
