Saved in:
| Main Author: | Lehner, Florian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.19724 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Tipsy cop and tipsy robber: collisions of biased random walks on graphs
by: Harris, Pamela E., et al.
Published: (2022)
by: Harris, Pamela E., et al.
Published: (2022)
On the cop number and the weak Meyniel conjecture for algebraic graphs
by: Biswas, Arindam, et al.
Published: (2023)
by: Biswas, Arindam, et al.
Published: (2023)
The Lamplighter groups have infinite weak cop number
by: Cornect, Anders, et al.
Published: (2024)
by: Cornect, Anders, et al.
Published: (2024)
Basis number of bounded genus graphs
by: Lehner, Florian, et al.
Published: (2024)
by: Lehner, Florian, et al.
Published: (2024)
Locally finite graphs and their localization numbers
by: Bonato, Anthony, et al.
Published: (2024)
by: Bonato, Anthony, et al.
Published: (2024)
$4K_1$-free graph with the cop number $3$
by: Char, Arnab, et al.
Published: (2025)
by: Char, Arnab, et al.
Published: (2025)
Blind cop-width and balanced minors of graphs
by: Buffière, Hector, et al.
Published: (2025)
by: Buffière, Hector, et al.
Published: (2025)
4K_1 free graphs on 13 vertices have cop number at most 2
by: Wu, Zhaoyu
Published: (2026)
by: Wu, Zhaoyu
Published: (2026)
Coarse cops and robber in graphs and groups
by: Esperet, Louis, et al.
Published: (2025)
by: Esperet, Louis, et al.
Published: (2025)
Bounding the number of holes required for folding rectangular polyominoes into cubes
by: Lehner, Florian, et al.
Published: (2025)
by: Lehner, Florian, 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)
Self-avoiding walk is ballistic on graphs with more than one end
by: Lehner, Florian, et al.
Published: (2024)
by: Lehner, Florian, 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)
Improved bounds on the cop number when forbidding a minor
by: Kenter, Franklin, et al.
Published: (2023)
by: Kenter, Franklin, et al.
Published: (2023)
Patrolling cop vs omniscient robber
by: Chiarelli, Nina, et al.
Published: (2026)
by: Chiarelli, Nina, et al.
Published: (2026)
Seeing is not believing in limited visibility cops and robbers
by: Bašić, Bojan, et al.
Published: (2025)
by: Bašić, Bojan, et al.
Published: (2025)
Folding polyominoes into cubes
by: Aichholzer, Oswin, et al.
Published: (2024)
by: Aichholzer, Oswin, et al.
Published: (2024)
Edge Inversions in $(P_k)$-closed Groups
by: Hampshire, Kirwin, et al.
Published: (2026)
by: Hampshire, Kirwin, et al.
Published: (2026)
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)
Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)
by: Hodor, Jędrzej, et al.
Published: (2026)
4-cop-win graphs have at least 19 vertices
by: Turcotte, Jérémie, et al.
Published: (2020)
by: Turcotte, Jérémie, et al.
Published: (2020)
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)
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)
Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)
by: Das, Sandip, et al.
Published: (2023)
Distinguishing finite and infinite trees of arbitrary cardinality
by: Imrich, Wilfried, et al.
Published: (2025)
by: Imrich, Wilfried, et al.
Published: (2025)
On distance transitive graphs and $4$-geodesic transitive graphs
by: Huang, Jun-Jie
Published: (2025)
by: Huang, Jun-Jie
Published: (2025)
On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
by: Barbieri, Marco, et al.
Published: (2022)
by: Barbieri, Marco, et al.
Published: (2022)
Graphs of group actions and group actions on trees
by: Lehner, Florian, et al.
Published: (2026)
by: Lehner, Florian, et al.
Published: (2026)
Concentration of the hypergraph's weak independence number
by: Vakhrushev, Stepan
Published: (2025)
by: Vakhrushev, Stepan
Published: (2025)
On the weak $k$-metric dimension of Hamming graphs
by: Fernandez, Elena, et al.
Published: (2025)
by: Fernandez, Elena, et al.
Published: (2025)
Tournament transitivity of graphs
by: Santra, Kamal
Published: (2024)
by: Santra, Kamal
Published: (2024)
Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
by: Caro, Yair, et al.
Published: (2024)
by: Caro, Yair, et al.
Published: (2024)
Ramsey numbers of grid graphs
by: He, Xiaoyu, et al.
Published: (2025)
by: He, Xiaoyu, et al.
Published: (2025)
On upper domatic number of graphs
by: Paul, Subhabrata, et al.
Published: (2024)
by: Paul, Subhabrata, et al.
Published: (2024)
Threshold numbers of some graphs
by: Wang, Runze
Published: (2024)
by: Wang, Runze
Published: (2024)
Fractional forcing number of graphs
by: Ebrahimi, Javad B., et al.
Published: (2020)
by: Ebrahimi, Javad B., et al.
Published: (2020)
On the representation number of grid graphs and cylindric grid graphs
by: Alshammari, Nawaf Shafi, et al.
Published: (2025)
by: Alshammari, Nawaf Shafi, et al.
Published: (2025)
Turán number of complete multipartite graphs in multipartite graphs
by: Han, Jie, et al.
Published: (2024)
by: Han, Jie, et al.
Published: (2024)
On the radius and the attachment number of tetravalent half-arc-transitive graphs
by: Potočnik, Primož, et al.
Published: (2017)
by: Potočnik, Primož, et al.
Published: (2017)
On the number of generators of groups acting arc-transitively on graphs
by: Barbieri, Marco, et al.
Published: (2024)
by: Barbieri, Marco, et al.
Published: (2024)
Similar Items
-
Tipsy cop and tipsy robber: collisions of biased random walks on graphs
by: Harris, Pamela E., et al.
Published: (2022) -
On the cop number and the weak Meyniel conjecture for algebraic graphs
by: Biswas, Arindam, et al.
Published: (2023) -
The Lamplighter groups have infinite weak cop number
by: Cornect, Anders, et al.
Published: (2024) -
Basis number of bounded genus graphs
by: Lehner, Florian, et al.
Published: (2024) -
Locally finite graphs and their localization numbers
by: Bonato, Anthony, et al.
Published: (2024)