Prefer a chat interface with context about you and your work?
Hamiltonian cycles through a linear forest
Let G be a graph of order n. A graph is linear forest if every component is a path. Let S be a set of m edges of G that induces a linear forest. An edge xy ∈E(G) is called an S-edge if xy ∈S. An S-edge-length of a cycle …