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

DOI10.21136/CMJ.2022.0544-19OpenAlexW4210257988MaRDI QIDQ5084246

Limning Xiong, Tao Tian, Shipeng Wang, Zhi-Hong Chen

Publication date: 23 June 2022

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/cmj.2022.0544-19

zbMATH Keywords

line graphclosuretraceable graphspanning trail

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (2)

On sufficient degree conditions for traceability of claw-free graphs ⋮ Spanning trails in a 2-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Cubic maximal nontraceable graphs
• Traceability of line graphs
• Graphs without spanning closed trails
• On dominating and spanning circuits in graphs
• Claw-free graphs---a survey
• On a closure concept in claw-free graphs
• Eulerian subgraphs and Hamilton-connected line graphs
• On sufficient degree conditions for traceability of claw-free graphs
• 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
• Spanning trails in a 2-connected graph
• Traceability on 2-connected line graphs
• Recent advances on the Hamiltonian problem: survey III
• Longest paths and cycles in K1,3-free graphs
• A reduction method to find spanning Eulerian subgraphs
• Hamiltonian line graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• Hamiltonicity and Degrees of Adjacent Vertices in Claw‐Free Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Degree sums of adjacent vertices for traceability of claw-free graphs