Fan type condition and characterization of Hamiltonian graphs

DOI10.1090/S0002-9939-2014-11977-0zbMath1290.05095OpenAlexW2064410821MaRDI QIDQ5418542

Ping Zhang, Kewen Zhao, Chunwei Song

Publication date: 4 June 2014

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-2014-11977-0

zbMATH Keywords

HamiltonianOre conditionFan conditionBenhocine-Wojda condition

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (1)

Hamiltonian paths, unit-interval complexes, and determinantal facet ideals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Advances on the Hamiltonian problem -- a survey
• An efficient condition for a graph to be Hamiltonian
• Note on Hamilton Circuits
• Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees
• Some Theorems on Abstract Graphs

This page was built for publication: Fan type condition and characterization of Hamiltonian graphs