A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Kenta Ozeki, Masao Tsugaki. A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph. Electr. J. Comb., 30(4), 2023. [doi]

@article{OzekiT23,
  title = {A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph},
  author = {Kenta Ozeki and Masao Tsugaki},
  year = {2023},
  doi = {10.37236/11698},
  url = {https://doi.org/10.37236/11698},
  researchr = {https://researchr.org/publication/OzekiT23},
  cites = {0},
  citedby = {0},
  journal = {Electr. J. Comb.},
  volume = {30},
  number = {4},
}

runs on WebDSL