3-extendability of 8-regular optimal 1-embedded Klein-bottle graphs
Prove that every 8-regular optimal 1-embedded graph on the Klein bottle is 3-extendable.
References
In the end of the paper, we furhter establish the following conjecture concern with matching extendability of those graphs. Every $8$-regular optimal $1$-embedded graph on the Klein bottle is $3$-extendable.
— Connectivity and matching extendability of optimal $1$-embedded graphs on the torus
(2501.02726 - Koizumi et al., 6 Jan 2025) in Conjecture 2, Section Remarks