The Hamilton-connectivity with the degree sum of non-adjacent subgraphs \(P_4\) and \(K_1\) in claw-free graphs

DOI10.15960/J.CNKI.ISSN.1007-6093.2016.01.011zbMATH Open1363.05148MaRDI QIDQ2825052

Wei Zheng, Ligong Wang

Publication date: 6 October 2016

Published in: Operations Research Transactions (Search for Journal in Brave)

zbMATH Keywords

claw-free graphHamilton-connectivitydegree of subgraphnon-adjacent subgraph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum

This page was built for publication: The Hamilton-connectivity with the degree sum of non-adjacent subgraphs \(P_4\) and \(K_1\) in claw-free graphs

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