Graphs with two isomorphism classes of spanning unicycle subgraphs (Q2277482)

A complete characterization is given for graphs whose spanning unicyclic subgraphs partition into exactly two isomorphism classes. This paper belongs to a series of papers about interesting characterization problems and spanning substructures. The topic is treated in a general setting in [author, Ars Comb. 24A, 47-58 (1987; Zbl 0663.05050); Rostocker Math. Kolloq. 38, 25-38(1989; Zbl 0724.05062)]. Closely related forerunners to the paper reviewed are [author, Discrete Math. 70, No.1, 103-108 (1988; Zbl 0658.05045); Graph theory in memory of G. A. Dirac Pap. Meet., Sandbjerg/Den. 1985, Ann. Discrete Math. 41, 421-435 (1989; Zbl 0686.05017)]. A further development is given in [\textit{P. Duchet}, Combinatorics, graph theory, and computing, Proc. 19th Southeast. Conf., Boca Raton/Fla. 1988, Congr. Numerantium 67, 45-58 (1988; Zbl 0678.05041); the author, Combinatorics, Proc. 7th Hung. Colloq., Eger/Hung. 1987, Colloq. Math. Soc. János Bolayi 52, 527-540 (1988; Zbl 0704.05045)].