Graphs whose vertices are forests with bounded degree: traceability (Q2839646)

A graph is said to be an \(f\)-graph if it has no vertex of degree greater than \(f\). The paper studies the Hamilton path properties of graphs whose vertices are the set of unlabeled \(f\)-forest and whose edges are such that there is an edge between vertices \(v\) and \(u\) if and only if, up to isomorphism, \(v\) and \(u\) differ by exactly on edge. In other words, if \(v\) is adjacent to \(u\), then either \(v\) is a one-edge deleted sub-forest of \(u\) or \(v\) is a one-edge extended super \(f\)-forest of \(u\). A graph is called traceable if it contains a Hamilton path. The paper studies the traceability of such graphs.