Cop numbers of periodic graphs
Fuente:
arXiv
Saved in:
| Main Authors: | De Carufel, Jean-Lou, Flocchini, Paola, Santoro, Nicola, Simard, Frédéric |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)
by: De Carufel, Jean-Lou, et al.
Published: (2024)
On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)
by: Bessy, Stéphane, et al.
Published: (2023)
Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)
by: Kinnersley, William B., et al.
Published: (2025)
On the inversion number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
by: Bang-Jensen, Jørgen, et al.
Published: (2021)
Primal-Dual Cops and Robber
by: Ha, Minh Tuan, et al.
Published: (2023)
by: Ha, Minh Tuan, et al.
Published: (2023)
On the Cop Number of String Graphs
by: Das, Sandip, et al.
Published: (2024)
by: Das, Sandip, et al.
Published: (2024)
$k$-Hyperopic Cops and Robber
by: Crawford, Nicholas, et al.
Published: (2024)
by: Crawford, Nicholas, et al.
Published: (2024)
On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)
by: Havet, Frédéric, et al.
Published: (2023)
Cops and Robber -- When Capturing is not Surrounding
by: Jungeblut, Paul, et al.
Published: (2023)
by: Jungeblut, Paul, et al.
Published: (2023)
Cops and Robbers for Graphs on Surfaces with Crossings
by: Bose, Prosenjit, et al.
Published: (2025)
by: Bose, Prosenjit, et al.
Published: (2025)
On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)
by: Biniaz, Ahmad, et al.
Published: (2023)
Pushing Cops and Robber on Graphs of Maximum Degree 4
by: Gahlawat, Harmender
Published: (2025)
by: Gahlawat, Harmender
Published: (2025)
Cops and robbers on $P_5$-free graphs
by: Chudnovsky, Maria, et al.
Published: (2023)
by: Chudnovsky, Maria, et al.
Published: (2023)
Fast and Furious: A study on Monotonicity and Speed in Cops-and-Robber Games
by: Fluck, Eva, et al.
Published: (2025)
by: Fluck, Eva, et al.
Published: (2025)
EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)
by: Bradley-Williams, David, et al.
Published: (2023)
Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)
by: Havet, Frédéric, et al.
Published: (2024)
Acyclic dichromatic number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
by: Bang-Jensen, Jørgen, et al.
Published: (2025)
The Frank number and nowhere-zero flows on graphs
by: Goedgebeur, Jan, et al.
Published: (2023)
by: Goedgebeur, Jan, et al.
Published: (2023)
Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)
by: Botler, Fábio, et al.
Published: (2023)
More results on the $z$-chromatic number of graphs
by: Khaleghi, Abbas, et al.
Published: (2023)
by: Khaleghi, Abbas, et al.
Published: (2023)
On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)
by: Aubian, Guillaume, et al.
Published: (2025)
On the $(\leq p)$-inversion diameter of oriented graphs
by: Havet, Frédéric, et al.
Published: (2026)
by: Havet, Frédéric, et al.
Published: (2026)
Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)
by: Gujgiczer, Anna, et al.
Published: (2023)
Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)
by: Hodor, Jędrzej, et al.
Published: (2024)
Representation number of word-representable co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)
by: Das, Biswajit, et al.
Published: (2025)
Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)
by: Eppstein, David, et al.
Published: (2022)
On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)
by: Duron, Julien, et al.
Published: (2023)
On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)
by: Das, Sandip, et al.
Published: (2023)
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)
Tree-independence number of $P_5$-free graphs with no large bicliques
by: Blažej, Václav, et al.
Published: (2026)
by: Blažej, Václav, et al.
Published: (2026)
Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
by: Dai, Mengyao, et al.
Published: (2025)
by: Dai, Mengyao, et al.
Published: (2025)
The tripartite-circle crossing number of graphs with two small partition classes
by: Camacho, Charles, et al.
Published: (2021)
by: Camacho, Charles, et al.
Published: (2021)
Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)
by: Duron, Julien, et al.
Published: (2024)
A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)
by: Pilipczuk, Marcin, et al.
Published: (2023)
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
by: Das, Sandip, et al.
Published: (2023)
by: Das, Sandip, et al.
Published: (2023)
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)
Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)
by: Hertz, Alain, et al.
Published: (2021)
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
Similar Items
-
Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024) -
On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024) -
Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026) -
Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023) -
Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)