Optimizing the trade-off between number of cops and capture time in cops and robbers

From MaRDI portal

Revision as of 20:39, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2073651

Jump to:navigation, search

DOI10.4310/JOC.2022.v13.n1.a4zbMath1482.05229arXiv1903.10087OpenAlexW2972326838MaRDI QIDQ2073651

Boris Brimkov, Jane Breen, Carolyn Reinhart, K. E. Perry, Leslie Hogben, Joshua Carlson, Sean English, Jesse T. Geneson, Anthony Bonato

Publication date: 3 February 2022

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.10087

zbMATH Keywords

chordal graph cops and robbers graph searching throttling product throttling

Mathematics Subject Classification ID

Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

This page was built for publication: Optimizing the trade-off between number of cops and capture time in cops and robbers

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2073651&oldid=14556637"