Some recent results in hamiltonian graphs

DOI10.1002/jgt.3190010109zbMath0353.05041OpenAlexW2050371295MaRDI QIDQ4123356

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)

Related Items (4)

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

Cites Work

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

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