Seeing is not believing in limited visibility cops and robbers
Fuente:
arXiv
Saved in:
| Main Authors: | Bašić, Bojan, Davies, Alfie, Džuklevski, Aleksa, Gvozdić, Strahinja, Mogge, Yannick |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024)
by: Jain, Suryaansh, et al.
Published: (2024)
A cop-robber game on metric graphs
by: Berend, Daniel, et al.
Published: (2025)
by: Berend, Daniel, et al.
Published: (2025)
Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024)
by: Ben-Ameur, Walid, et al.
Published: (2024)
Monotonicity of the cops and robber game for bounded depth treewidth
by: Adler, Isolde, et al.
Published: (2024)
by: Adler, Isolde, et al.
Published: (2024)
Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
by: Bašić, Milan
Published: (2026)
by: Bašić, Milan
Published: (2026)
Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Trees with proper thinness 2
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)
Weakly toll convexity and proper interval graphs
by: Dourado, Mitre C., et al.
Published: (2022)
by: Dourado, Mitre C., et al.
Published: (2022)
Characterizations of graph classes via convex geometries: a survey
by: Dourado, Mitre C., et al.
Published: (2022)
by: Dourado, Mitre C., et al.
Published: (2022)
Edge-apexing in hereditary classes of graphs
by: Singh, Jagdeep, et al.
Published: (2024)
by: Singh, Jagdeep, et al.
Published: (2024)
Cops and robbers on chess graphs
by: Ambrose, Sally, et al.
Published: (2025)
by: Ambrose, Sally, et al.
Published: (2025)
Efficient polynomial-time approximation scheme for the genus of dense graphs
by: Jing, Yifan, et al.
Published: (2020)
by: Jing, Yifan, et al.
Published: (2020)
Cops and robbers on $P_5$-free graphs
by: Chudnovsky, Maria, et al.
Published: (2023)
by: Chudnovsky, Maria, et al.
Published: (2023)
$4K_1$-free graph with the cop number $3$
by: Char, Arnab, et al.
Published: (2025)
by: Char, Arnab, et al.
Published: (2025)
The one-visibility Localization game
by: Bonato, Anthony, et al.
Published: (2023)
by: Bonato, Anthony, et al.
Published: (2023)
Cops and robbers on $2K_2$-free graphs
by: Turcotte, Jérémie
Published: (2020)
by: Turcotte, Jérémie
Published: (2020)
Clique-Width: Harnessing the Power of Atoms
by: Dabrowski, Konrad K., et al.
Published: (2020)
by: Dabrowski, Konrad K., et al.
Published: (2020)
Larger Nearly Orthogonal Sets over Finite Fields
by: Haviv, Ishay, et al.
Published: (2024)
by: Haviv, Ishay, et al.
Published: (2024)
Scarf's Algorithm on Arborescence Hypergraphs
by: Chandrasekaran, Karthekeyan, et al.
Published: (2024)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2024)
$k$-path graphs: experiments and conjectures about algebraic connectivity and $α$-index
by: de Paula, Rafael L., et al.
Published: (2025)
by: de Paula, Rafael L., et al.
Published: (2025)
On Well-VE-Dominated Graphs
by: Büyükçolak, Yasemin
Published: (2025)
by: Büyükçolak, Yasemin
Published: (2025)
On the structure of ($4K_1$, $C_4$, $P_6$)-free graphs
by: Hoàng, Chính T., et al.
Published: (2025)
by: Hoàng, Chính T., et al.
Published: (2025)
Every Graph is Essential to Large Treewidth
by: Alecu, Bogdan, et al.
Published: (2025)
by: Alecu, Bogdan, et al.
Published: (2025)
Structural and Spectral Properties of Strictly Interval Graphs
by: Justel, Claudia, et al.
Published: (2025)
by: Justel, Claudia, et al.
Published: (2025)
Twin-width of subdivisions of multigraphs
by: Ahn, Jungho, et al.
Published: (2023)
by: Ahn, Jungho, et al.
Published: (2023)
Growing Trees and Amoebas' Replications
by: Gurvich, Vladimir, et al.
Published: (2024)
by: Gurvich, Vladimir, et al.
Published: (2024)
Spanning caterpillar in biconvex bipartite graphs
by: Antony, Dhanyamol, et al.
Published: (2023)
by: Antony, Dhanyamol, et al.
Published: (2023)
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Anil, Arun, et al.
Published: (2023)
by: Anil, Arun, et al.
Published: (2023)
Fully graphic degree sequences and P-stable degree sequences
by: Erdős, Péter L., et al.
Published: (2024)
by: Erdős, Péter L., et al.
Published: (2024)
Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
by: Beaton, Iain, et al.
Published: (2026)
by: Beaton, Iain, et al.
Published: (2026)
Braces of Perfect Matching Width 2
by: Giannopoulou, Archontia C., et al.
Published: (2019)
by: Giannopoulou, Archontia C., et al.
Published: (2019)
Avoidability beyond paths
by: Gurvich, Vladimir, et al.
Published: (2022)
by: Gurvich, Vladimir, et al.
Published: (2022)
Cops and Attacking Robbers with Cycle Constraints
by: Clow, Alexander, et al.
Published: (2024)
by: Clow, Alexander, et al.
Published: (2024)
A note on highly connected $K_{2,\ell}$-minor free graphs
by: Bousquet, Nicolas, et al.
Published: (2023)
by: Bousquet, Nicolas, et al.
Published: (2023)
Forbidden induced subgraphs in iterative higher order line graphs
by: Sanghi, Aryan, et al.
Published: (2024)
by: Sanghi, Aryan, et al.
Published: (2024)
Perfect divisibility of some bull-free graphs and its application
by: Chen, Ran, et al.
Published: (2026)
by: Chen, Ran, et al.
Published: (2026)
The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)
by: Girão, António, et al.
Published: (2026)
On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)
by: Davies, Ewan, et al.
Published: (2025)
The capture time in the game of cops and many robbers
by: Gyergyek, Miha, et al.
Published: (2025)
by: Gyergyek, Miha, et al.
Published: (2025)
Efficient $k$-limited Dominating Broadcasts in Product Graphs
by: Bharadwaj, et al.
Published: (2025)
by: Bharadwaj, et al.
Published: (2025)
Similar Items
-
A bound for the cops and robber problem in terms of 2-component order connectivity
by: Jain, Suryaansh, et al.
Published: (2024) -
A cop-robber game on metric graphs
by: Berend, Daniel, et al.
Published: (2025) -
Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024) -
Monotonicity of the cops and robber game for bounded depth treewidth
by: Adler, Isolde, et al.
Published: (2024) -
Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
by: Bašić, Milan
Published: (2026)