In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts

DOI10.1007/BF01305995zbMath0353.05043MaRDI QIDQ1236125

Herbert Fleischner

Publication date: 1976

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/177773

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

Related Items

A short proof of the versatile version of Fleischner's theorem, Cycles in squares of trees without generalized claws, Bipanconnectivity of faulty hypercubes with minimum degree, A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs, Graphs with cyclomatic number two having panconnected square, Extending cycles in graphs, Powers of connected graphs and hamiltonicity, Contractions, cycle double covers, and cyclic colorings in locally connected graphs, On graphs whose square have strong Hamiltonian properties, A new proof of the theorem by Fleischner, Single-source three-disjoint path covers in cubes of connected graphs, Disjoint path covers in cubes of connected graphs, Unnamed Item

Cites Work

• Unnamed Item
• A necessary condition for the square of a graph to be Hamiltonian
• The square of a block is vertex pancyclic
• Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen
• Hamiltonian Total Graphs
• Minimally 2-connected graphs.