Spanning path-cycle systems with given end-vertices in regular graphs

DOI10.1007/S00373-025-02996-5MaRDI QIDQ6866172zbMATH OpenFDO

Authors Yoshimi Egawa, Mikio Kano, Kenta Ozeki

Publication date 29 January 2026

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

Full work available at URL https://doi.org/10.1007/S00373-025-02996-5

zbMATH Keywords

\(r\)-edge-connected graphsconnected claw-free graphs

Mathematics Subject Classification ID

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

Cites work

• A Short Proof of the Factor Theorem for Finite Graphs
• Characterization of 1-tough graphs using factors
• Degree factors with red-blue coloring of regular graphs
• DisjointT-paths in tough graphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• Factors with red-blue coloring of claw-free graphs and cubic graphs
• The Factors of Graphs

This page was built for publication: Spanning path-cycle systems with given end-vertices in regular graphs

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