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

DOI10.7151/DMGT.2125zbMath1439.05131OpenAlexW2811448670WikidataQ129587911 ScholiaQ129587911MaRDI QIDQ2282467

Tao Tian, Limning Xiong

Publication date: 8 January 2020

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

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

zbMATH Keywords

Hamiltonian cycleclosuredegree sum of adjacent verticesdominating closed trial

Mathematics Subject Classification ID

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

Related Items (1)

Degree sums of adjacent vertices for traceability of claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• New sufficient conditions for cycles in graphs
• Graphs without spanning closed trails
• On dominating and spanning circuits in graphs
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• Recent advances on the Hamiltonian problem: survey III
• Note on Hamilton Circuits
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Hamiltonicity and Degrees of Adjacent Vertices in Claw‐Free Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs

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