Dániel Gerbner, Balázs Keszegh, Dániel Lenger, Dániel T. Nagy, Dömötör Pálvölgyi, Balázs Patkós, Máté Vizer, Gábor Wiener. k copies of a subgraph, and a related problem in search theory. Discrete Applied Mathematics, 341:196-203, December 2023. [doi]
@article{GerbnerKLNPPVW23,
title = {k copies of a subgraph, and a related problem in search theory},
author = {Dániel Gerbner and Balázs Keszegh and Dániel Lenger and Dániel T. Nagy and Dömötör Pálvölgyi and Balázs Patkós and Máté Vizer and Gábor Wiener},
year = {2023},
month = {December},
doi = {10.1016/j.dam.2023.08.012},
url = {https://doi.org/10.1016/j.dam.2023.08.012},
researchr = {https://researchr.org/publication/GerbnerKLNPPVW23},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {341},
pages = {196-203},
}