Connected [a, b]-factors in K::1, n::-free graphs containing an [a, b]-factor

Taro Tokuda. Connected [a, b]-factors in K::1, n::-free graphs containing an [a, b]-factor. Discrete Mathematics, 207(1-3):293-298, 1999. [doi]

@article{Tokuda99,
  title = {Connected [a, b]-factors in K::1, n::-free graphs containing an [a, b]-factor},
  author = {Taro Tokuda},
  year = {1999},
  doi = {10.1016/S0012-365X(99)00113-2},
  url = {http://dx.doi.org/10.1016/S0012-365X(99)00113-2},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Tokuda99},
  cites = {0},
  citedby = {0},
  journal = {Discrete Mathematics},
  volume = {207},
  number = {1-3},
  pages = {293-298},
}