Long cycles passing through a linear forest

DOI10.1007/s00373-020-02142-3zbMath1439.05121OpenAlexW3008876895MaRDI QIDQ2175797

Shunzhe Zhang, Feifei Song

Publication date: 30 April 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02142-3

zbMATH Keywords

degree sumlongest cyclelinear forest\((k+m)\)-connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Cycles and paths through specified vertices in k-connected graphs
• Cycles through three vertices in 2-connected graphs
• Long cycles through a linear forest
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Long paths and large cycles in finite graphs
• Cycles passing throughk + 1 vertices ink-connected graphs
• Long cycles passing through vertices in k‐connected graphs
• Cycles and Connectivity in Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Long cycles passing through a linear forest