2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices

DOI10.7151/DMGT.2125MaRDI QIDQ2282467zbMATH OpenOpenAlexWikidataFDO

Authors Tao Tian, Liming Xiong

Publication date 8 January 2020

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2125

zbMATH Keywords

closuredegree sum of adjacent verticesdominating closed trialHamiltonian cycle

Mathematics Subject Classification ID

Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45)

Review text

In this article, the authors characterise, for \(n\) sufficiently large, all non-Hamiltonian 2-connected claw-free graphs \(G\) of order \(n\) such that \(d(u)+d(v) \geqslant \frac{2n}{5}-1\) for every edge \(uv\) of \(G\). This improves an earlier result of \textit{Z.-H. Chen} [J. Graph Theory 86, 193--212 (2017; Zbl 1370.05124)]. Various corollaries are deduced.

Recommendations

• Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
• Hamiltonian cycles in 2-connected claw-free graphs
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs
• Hamiltonicity and degrees of adjacent vertices in claw-free graphs

Cites work

• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Claw-free graphs---a survey
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs
• Graph theory
• Graphs without spanning closed trails
• Hamilton cycles in claw-free graphs
• Hamiltonicity and degrees of adjacent vertices in claw-free graphs
• scientific article; zbMATH DE number 1151803 (Why is no real title available?)
• Longest paths and cycles in K1,3-free graphs
• New sufficient conditions for cycles in graphs
• Note on Hamilton Circuits
• On a closure concept in claw-free graphs
• On dominating and spanning circuits in graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Recent advances on the Hamiltonian problem: survey III

Cited in

(8)

• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs
• scientific article; zbMATH DE number 5631247 (Why is no real title available?)
• Degree sums of adjacent vertices for traceability of claw-free graphs
• Hamiltonicity and degrees of adjacent vertices in claw-free graphs
• Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
• Hamilton-connected claw-free graphs with Ore-degree conditions
• Edge degree conditions for dominating and spanning closed trails

This page was built for publication: 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices

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