On weak cop numbers of transitive graphs
Fuente:
arXiv
Guardado en:
| Autor principal: | Lehner, Florian |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Tipsy cop and tipsy robber: collisions of biased random walks on graphs
por: Harris, Pamela E., et al.
Publicado: (2022)
por: Harris, Pamela E., et al.
Publicado: (2022)
On the cop number and the weak Meyniel conjecture for algebraic graphs
por: Biswas, Arindam, et al.
Publicado: (2023)
por: Biswas, Arindam, et al.
Publicado: (2023)
The Lamplighter groups have infinite weak cop number
por: Cornect, Anders, et al.
Publicado: (2024)
por: Cornect, Anders, et al.
Publicado: (2024)
Locally finite graphs and their localization numbers
por: Bonato, Anthony, et al.
Publicado: (2024)
por: Bonato, Anthony, et al.
Publicado: (2024)
Basis number of bounded genus graphs
por: Lehner, Florian, et al.
Publicado: (2024)
por: Lehner, Florian, et al.
Publicado: (2024)
$4K_1$-free graph with the cop number $3$
por: Char, Arnab, et al.
Publicado: (2025)
por: Char, Arnab, et al.
Publicado: (2025)
Blind cop-width and balanced minors of graphs
por: Buffière, Hector, et al.
Publicado: (2025)
por: Buffière, Hector, et al.
Publicado: (2025)
4K_1 free graphs on 13 vertices have cop number at most 2
por: Wu, Zhaoyu
Publicado: (2026)
por: Wu, Zhaoyu
Publicado: (2026)
Coarse cops and robber in graphs and groups
por: Esperet, Louis, et al.
Publicado: (2025)
por: Esperet, Louis, et al.
Publicado: (2025)
Bounding the number of holes required for folding rectangular polyominoes into cubes
por: Lehner, Florian, et al.
Publicado: (2025)
por: Lehner, Florian, et al.
Publicado: (2025)
Complexity results for a cops and robber game on directed graphs
por: Ben-Ameur, Walid, et al.
Publicado: (2024)
por: Ben-Ameur, Walid, et al.
Publicado: (2024)
Self-avoiding walk is ballistic on graphs with more than one end
por: Lehner, Florian, et al.
Publicado: (2024)
por: Lehner, Florian, et al.
Publicado: (2024)
A cop-robber game on metric graphs
por: Berend, Daniel, et al.
Publicado: (2025)
por: Berend, Daniel, et al.
Publicado: (2025)
Improved bounds on the cop number when forbidding a minor
por: Kenter, Franklin, et al.
Publicado: (2023)
por: Kenter, Franklin, et al.
Publicado: (2023)
Patrolling cop vs omniscient robber
por: Chiarelli, Nina, et al.
Publicado: (2026)
por: Chiarelli, Nina, et al.
Publicado: (2026)
Seeing is not believing in limited visibility cops and robbers
por: Bašić, Bojan, et al.
Publicado: (2025)
por: Bašić, Bojan, et al.
Publicado: (2025)
Centered colorings and weak coloring numbers in minor-closed graph classes
por: Hodor, Jędrzej, et al.
Publicado: (2026)
por: Hodor, Jędrzej, et al.
Publicado: (2026)
Monotonicity of the cops and robber game for bounded depth treewidth
por: Adler, Isolde, et al.
Publicado: (2024)
por: Adler, Isolde, et al.
Publicado: (2024)
Folding polyominoes into cubes
por: Aichholzer, Oswin, et al.
Publicado: (2024)
por: Aichholzer, Oswin, et al.
Publicado: (2024)
Edge Inversions in $(P_k)$-closed Groups
por: Hampshire, Kirwin, et al.
Publicado: (2026)
por: Hampshire, Kirwin, et al.
Publicado: (2026)
A bound for the cops and robber problem in terms of 2-component order connectivity
por: Jain, Suryaansh, et al.
Publicado: (2024)
por: Jain, Suryaansh, et al.
Publicado: (2024)
Counting the minimum number of arcs in an oriented graph having weak diameter 2
por: Das, Sandip, et al.
Publicado: (2023)
por: Das, Sandip, et al.
Publicado: (2023)
On distance transitive graphs and $4$-geodesic transitive graphs
por: Huang, Jun-Jie
Publicado: (2025)
por: Huang, Jun-Jie
Publicado: (2025)
4-cop-win graphs have at least 19 vertices
por: Turcotte, Jérémie, et al.
Publicado: (2020)
por: Turcotte, Jérémie, et al.
Publicado: (2020)
On the number of fixed edges of automorphisms of vertex-transitive graphs of small valency
por: Barbieri, Marco, et al.
Publicado: (2022)
por: Barbieri, Marco, et al.
Publicado: (2022)
The capture time in the game of cops and many robbers
por: Gyergyek, Miha, et al.
Publicado: (2025)
por: Gyergyek, Miha, et al.
Publicado: (2025)
Concentration of the hypergraph's weak independence number
por: Vakhrushev, Stepan
Publicado: (2025)
por: Vakhrushev, Stepan
Publicado: (2025)
Distinguishing finite and infinite trees of arbitrary cardinality
por: Imrich, Wilfried, et al.
Publicado: (2025)
por: Imrich, Wilfried, et al.
Publicado: (2025)
On the weak $k$-metric dimension of Hamming graphs
por: Fernandez, Elena, et al.
Publicado: (2025)
por: Fernandez, Elena, et al.
Publicado: (2025)
Comparing the $p$-independence number of regular graphs to the $q$-independence number of their line graphs
por: Caro, Yair, et al.
Publicado: (2024)
por: Caro, Yair, et al.
Publicado: (2024)
Tournament transitivity of graphs
por: Santra, Kamal
Publicado: (2024)
por: Santra, Kamal
Publicado: (2024)
Ramsey numbers of grid graphs
por: He, Xiaoyu, et al.
Publicado: (2025)
por: He, Xiaoyu, et al.
Publicado: (2025)
On upper domatic number of graphs
por: Paul, Subhabrata, et al.
Publicado: (2024)
por: Paul, Subhabrata, et al.
Publicado: (2024)
Threshold numbers of some graphs
por: Wang, Runze
Publicado: (2024)
por: Wang, Runze
Publicado: (2024)
Fractional forcing number of graphs
por: Ebrahimi, Javad B., et al.
Publicado: (2020)
por: Ebrahimi, Javad B., et al.
Publicado: (2020)
On the representation number of grid graphs and cylindric grid graphs
por: Alshammari, Nawaf Shafi, et al.
Publicado: (2025)
por: Alshammari, Nawaf Shafi, et al.
Publicado: (2025)
Turán number of complete multipartite graphs in multipartite graphs
por: Han, Jie, et al.
Publicado: (2024)
por: Han, Jie, et al.
Publicado: (2024)
Turán number of complete bipartite graphs with bounded matching number
por: Luo, Huan, et al.
Publicado: (2024)
por: Luo, Huan, et al.
Publicado: (2024)
The balancing number and list balancing number of some graph classes
por: Dailly, Antoine, et al.
Publicado: (2020)
por: Dailly, Antoine, et al.
Publicado: (2020)
Bounds for the Grundy chromatic number of graphs in terms of domination number
por: Khaleghi, Abbas, et al.
Publicado: (2022)
por: Khaleghi, Abbas, et al.
Publicado: (2022)
Ejemplares similares
-
Tipsy cop and tipsy robber: collisions of biased random walks on graphs
por: Harris, Pamela E., et al.
Publicado: (2022) -
On the cop number and the weak Meyniel conjecture for algebraic graphs
por: Biswas, Arindam, et al.
Publicado: (2023) -
The Lamplighter groups have infinite weak cop number
por: Cornect, Anders, et al.
Publicado: (2024) -
Locally finite graphs and their localization numbers
por: Bonato, Anthony, et al.
Publicado: (2024) -
Basis number of bounded genus graphs
por: Lehner, Florian, et al.
Publicado: (2024)