Image de couverture de livre

Primal-Dual Cops and Robber

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ha, Minh Tuan, Jungeblut, Paul, Ueckerdt, Torsten, Żyliński, Paweł
Format:	Preprint
Publié:	2023
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Cops and Robber -- When Capturing is not Surrounding
par: Jungeblut, Paul, et autres
Publié: (2023)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
par: Jungeblut, Paul, et autres
Publié: (2022)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
par: Goetze, Miriam, et autres
Publié: (2024)

Accelerated Cops and Robbers
par: Kinnersley, William B., et autres
Publié: (2025)

$k$-Hyperopic Cops and Robber
par: Crawford, Nicholas, et autres
Publié: (2024)

Cops and Robbers for Graphs on Surfaces with Crossings
par: Bose, Prosenjit, et autres
Publié: (2025)

Pushing Cops and Robber on Graphs of Maximum Degree 4
par: Gahlawat, Harmender
Publié: (2025)

Fast and Furious: A study on Monotonicity and Speed in Cops-and-Robber Games
par: Fluck, Eva, et autres
Publié: (2025)

A Note on Polychromatic Colorings of Shift-Chains
par: Ueckerdt, Torsten
Publié: (2024)

Clustered independence and bounded treewidth
par: Knauer, Kolja, et autres
Publié: (2023)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
par: Schneider, Samuel, et autres
Publié: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
par: Goetze, Miriam, et autres
Publié: (2025)

Cops and Attacking Robbers with Cycle Constraints
par: Clow, Alexander, et autres
Publié: (2024)

Boundedness and Separation in the Graph Covering Number Framework
par: Goetze, Miriam, et autres
Publié: (2025)

Edge densities of drawings of graphs with one forbidden cell
par: Hahn, Benedikt, et autres
Publié: (2025)

Partitioning a Planar Graph into two Triangle-Forests
par: Knauer, Kolja, et autres
Publié: (2024)

Guarding isometric subgraphs and Cops and Robber in planar graphs
par: de la Maza, Sebastián González Hermosillo, et autres
Publié: (2024)

Cops & Robber on Periodic Temporal Graphs
par: De Carufel, Jean-Lou, et autres
Publié: (2024)

Cops and Robbers, Clique Covers, and Induced Cycles
par: Clow, Alexander, et autres
Publié: (2025)

Cop numbers of periodic graphs
par: De Carufel, Jean-Lou, et autres
Publié: (2023)

On the Cop Number of String Graphs
par: Das, Sandip, et autres
Publié: (2024)

Cops and Robbers on Multi-Layer Graphs
par: Enright, Jessica, et autres
Publié: (2023)

Odd coloring graphs with linear neighborhood complexity
par: Davies, James, et autres
Publié: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
par: Hatzel, Meike, et autres
Publié: (2023)

On 1-Planar Graphs with Bounded Cop-Number
par: Bose, Prosenjit, et autres
Publié: (2024)

Cops and robber in graphs with bounded vertex cover number
par: Bose, Prosenjit, et autres
Publié: (2026)

Intersection Graphs with and without Product Structure
par: Merker, Laura, et autres
Publié: (2024)

Flipping Non-Crossing Spanning Trees
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2024)

Capturing an Invisible Robber using Separators
par: Potapov, Igor, et autres
Publié: (2025)

Cops and robbers on $P_5$-free graphs
par: Chudnovsky, Maria, et autres
Publié: (2023)

Flip-width: Cops and Robber on dense graphs
par: Toruńczyk, Szymon
Publié: (2023)

Combinatorial Gray codes-an updated survey
par: Mütze, Torsten
Publié: (2022)

On the Multi-Robber Damage Number
par: Stojaković, Miloš, et autres
Publié: (2022)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

List coloring ordered graphs with forbidden induced subgraphs
par: Piecyk, Marta, et autres
Publié: (2025)

Multiset Metric Dimension of Binomial Random Graphs
par: Eide, Austin, et autres
Publié: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
par: Rzążewski, Paweł, et autres
Publié: (2024)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
par: Mütze, Torsten, et autres
Publié: (2024)

Clique-width and induced topological minors
par: Bieliński, Paweł Rafał, et autres
Publié: (2026)

A multipartite analogue of Dilworth's Theorem
par: Fox, Jacob, et autres
Publié: (2024)