no. 16 · Tuesday 17 November 2026
Characterization of Cubic Graphs with Exactly Two Lonely Edges
Abstract
Perfect matchings are fundamental to understanding structural connectivity in cubic graphs, with "lonely edges" (edges in exactly one perfect matching) forming a critical underexplored class. Goedgebeur et al. (J. Graph Theory, 112 (2026) 276-289) established an upper bound of 6 on the number of lonely edges in 3-connected non-double covered cubic graphs and completely characterized the classes $\mathcal{U}_k$ for $3 \le k \le 6$. Narayana et al. subsequently gave a recursive characterization of the subclass in which the two lonely edges lie in the same perfect matching. This paper completes the classification by presenting a full structural characterization of $\mathcal{U}_2$, the family of 3-connected cubic graphs with exactly two lonely edges. We identify the minimally non-contractible "primitive kernels" of $\mathcal{U}_2$ and develop constructive operations to generate any graph in $\mathcal{U}_2$ from these kernels.
- fields
- Combinatorics