The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs

DOI10.1007/S10255-019-0835-5zbMATH Open1419.05118OpenAlexW2964346388WikidataQ127446489 ScholiaQ127446489MaRDI QIDQ2274182FDOQ2274182

Authors: Wei Zheng, Ligong Wang 

Publication date: 19 September 2019

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-019-0835-5

Recommendations

• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs \(P_4\) and \(K_1\) in claw-free graphs
• 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
• scientific article; zbMATH DE number 1381050
• Hamiltonian connected claw-free graphs
• Hamiltonian connectedness in claw-free graphs

zbMATH Keywords

claw-free graphHamilton pathdegree of subgraphnon-adjacent subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Graph invariants and large cycles: a survey

Cited In (6)

• Degree sums of adjacent vertices for traceability of claw-free graphs
• Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum
• Title not available (Why is that?)
• Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
• 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
• The Hamilton-connectivity with the degree sum of non-adjacent subgraphs \(P_4\) and \(K_1\) in claw-free graphs

This page was built for publication: The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs

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