@article {IOPORT.00500365,
    author       = {Zhao, Bingxin},
    title        = {On OF-$k$ type graphs with some properties.},
    year         = {1993},
    journal      = {Journal of Shandong University. Natural Science Edition},
    volume       = {28},
    number       = {3},
    issn         = {0559-7234},
    pages        = {274-279},
    publisher    = {China International Book Trading Corporation (Guoji Shudian), Beijing},
    abstract     = {Summary: Properties of $\text{OF-}k$ type graphs and the following results are discussed. (1) The OF-($-$3) type graph of order $2n$ contains the subgraph $(n-1)k\sb 2$. (2) If an OF-($-$2) type graph $G$ contains no 1- factor then $G$ has the following properties: (i) $V\sb \delta$ is an independent vertex set with $\vert V\sb \delta\vert= n+1$ and (ii) for all $w,z\in V\sb \delta$, $G-\{w,z\}$ contains $(n-1)$ disjoint factors, where $V\sb \delta=\{v\in V(G)\mid d\sb G(v)= \delta(G)\}$.},
    identifier   = {00500365},
}