Some recent results in hamiltonian graphs

DOI10.1002/JGT.3190010109MaRDI QIDQ4123356zbMATH OpenOpenAlexFDO

Authors Linda Lesniak

Publication date 1977

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190010109

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• A sufficient condition for Hamiltonian circuits
• On Hamilton's ideals
• On the Cube of a Graph
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• Pancyclic graphs. I
• Pancyclic graphs. II
• The binding number of a graph and its Anderson number
• The cube of every connected graph is 1-hamiltonian
• The square of a block is Hamiltonian connected
• The square of a block is strongly path connected
• The square of a block is vertex pancyclic
• The square of every two-connected graph is Hamiltonian

Cited in

(4)

• Graph theory (algorithmic, algebraic, and metric problems)
• Graphs and degree sequences. I
• Degree conditions for Hamiltonicity: counting the number of missing edges
• \((n-3)\)-edge-fault-tolerant weak-pancyclicity of \((n,k)\)-star graphs

This page was built for publication: Some recent results in hamiltonian graphs

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