Characterization of Cubic Graphs with Exactly Two Lonely Edges

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.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-16
DOI
https://doi.org/10.48550/arxiv.2611.20843
Primary Topic
Advanced Graph Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Characterization of Cubic Graphs with Exactly Two Lonely Edges

Zewei Qian, Pingshan Li
arXiv (Cornell University)
Advanced Graph Theory Research
preprint

Characterization of Cubic Graphs with Exactly Two Lonely Edges

Zewei Qian, Pingshan Li
preprint en

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.

arXiv (Cornell University)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon