Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Journal Article
%1 journals/disopt/HeL23
%A He, Shunhai
%A Liu, Huiqing
%D 2023
%J Discret. Optim.
%K dblp
%P 100809
%T The maximum number of short paths in a Halin graph.
%U http://dblp.uni-trier.de/db/journals/disopt/disopt50.html#HeL23
%V 50
@article{journals/disopt/HeL23,
added-at = {2024-01-13T00:00:00.000+0100},
author = {He, Shunhai and Liu, Huiqing},
biburl = {https://www.bibsonomy.org/bibtex/2c188cab120886d8a31db5ca817cb2d3f/dblp},
ee = {https://doi.org/10.1016/j.disopt.2023.100809},
interhash = {00602c16613b4383f591fac9c2b36a08},
intrahash = {c188cab120886d8a31db5ca817cb2d3f},
journal = {Discret. Optim.},
keywords = {dblp},
month = {November},
pages = 100809,
timestamp = {2024-04-09T01:58:23.000+0200},
title = {The maximum number of short paths in a Halin graph.},
url = {http://dblp.uni-trier.de/db/journals/disopt/disopt50.html#HeL23},
volume = 50,
year = 2023
}