@article {IOPORT.05879545,
    author       = {Volkmann, Lutz},
    title        = {On almost 1-extendable graphs.},
    year         = {2010},
    journal      = {The Australasian Journal of Combinatorics},
    volume       = {47},
    issn         = {1034-4942},
    pages        = {83-89},
    publisher    = {Published for the Combinatorial Mathematics Society of Australasia by the Centre for Discrete Mathematics and Computing, the University of Queensland, Brisbane, QLD},
    abstract     = {Summary: A graph $G$ is 1-extendable or almost 1-extendable if every edge is contained in a perfect or almost perfect matching of $G$, respectively. Let $d\ge 3$ be an integer, and let $G$ be a graph of order $n$ with exactly one odd component such that the degree of each vertex is either $d$ or $d+ 1$. If $G$ is not almost 1-extendable, then we prove that $n\ge 2d+ 5$. In the special case that $d\ge 4$ is even and $G$ is a $d$-regular graph, we obtain the better bound $n\ge 3d+ 5$. Examples will show that the given bounds are best possible.},
    identifier   = {05879545},
}