A note on degree conditions for traceability in locally claw-free graphs

DOI10.1007/S11786-011-0074-5zbMath1254.05085OpenAlexW2089738577MaRDI QIDQ691626

Evelyne Flandrin, Roman Čada, Haiyan Kang

Publication date: 3 December 2012

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-011-0074-5

zbMATH Keywords

clawtraceabilitydegree conditionlocally claw-freegraph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Minimum degree, leaf number and traceability

Cites Work

• The \(*\)-closure for graphs and claw-free graphs
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• On a closure concept in claw-free graphs
• Cycles through given vertices and closures
• Non-traceability of large connected claw-free graphs
• On traceability and 2-factors in claw-free graphs
• Some Theorems on Abstract Graphs

This page was built for publication: A note on degree conditions for traceability in locally claw-free graphs