$\lambda$-matchability in cubic graphs

Santhosh Raghul, Nishad Kothari

A vertex $v$ of a 2-connected cubic graph $G$ is $\lambda$-matchable if $G$ has a spanning subgraph in which $v$ has degree three whereas every other vertex has degree one, and we let $λ…