Hamiltonian Total Graphs

DOI10.1002/MANA.19750680105MaRDI QIDQ4071775zbMATH OpenOpenAlexFDO

Authors Arthur M. Hobbs, Herbert Fleischner

Publication date 1975

Published in Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/mana.19750680105

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites work

• Some Hamiltonian results in powers of graphs

Cited in

(10)

• Hamiltonicity in vertex envelopes of plane cubic graphs
• A necessary condition for the square of a graph to be Hamiltonian
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Edge-pancyclicity of coupled graphs
• Vertex-pancyclicity of edge-face-total graphs
• A best possible result for the square of a 2-block to be Hamiltonian
• The transformation graph \(G^{xyz}\) when \(xyz=-++\)
• Transformation graph \(G^{-+-}\)
• The most general structure of graphs with Hamiltonian or Hamiltonian connected square
• Hamiltonicity of complements of middle graphs

This page was built for publication: Hamiltonian Total Graphs

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