Extremal problems on the Hamiltonicity of claw-free graphs

DOI10.1016/j.disc.2018.06.023zbMath1393.05173arXiv1504.04195OpenAlexW2808113633MaRDI QIDQ1660262

Bo Ning, Xing Peng, Bin Long Li

Publication date: 15 August 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.04195

zbMATH Keywords

eigenvaluesclaw-free graphclique numberHamilton cyclesclaw-free closure

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

The formula for Turán number of spanning linear forests ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ Distance spectrum, 1-factor and vertex-disjoint cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
• Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
• Spectral conditions for some graphical properties
• Small spectral gap in the combinatorial Laplacian implies Hamiltonian
• Arc coverings of graphs
• Hamilton connected graphs
• New sufficient conditions for cycles in graphs
• Signless Laplacian spectral radius and Hamiltonicity
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• On a closure concept in claw-free graphs
• Minimal \(2\)-connected non-Hamiltonian claw-free graphs
• Spectral radius and \(k\)-connectedness of a graph
• A sharp upper bound of the spectral radius of graphs
• Hamilton cycles and eigenvalues of graphs
• A stability version for a theorem of Erdős on nonhamiltonian graphs
• A note on Hamiltonian circuits
• The square of every two-connected graph is Hamiltonian
• On Hamiltonian bipartite graphs
• Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
• Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity
• Note on Hamilton Circuits
• Spectral Radius and Degree Sequence
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Longest paths and cycles in K1,3-free graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• Extensions of a theorem of Erdős on nonhamiltonian graphs
• Sparse pseudo‐random graphs are Hamiltonian
• Hamiltonian cycles in 2‐connected claw‐free‐graphs
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
• Spectral radius and Hamiltonian properties of graphs
• Spectral radius and Hamiltonicity of graphs

This page was built for publication: Extremal problems on the Hamiltonicity of claw-free graphs