Imagen de Portada

Cops and robbers pebbling in graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Clarke, Nancy, Forkin, Joshua, Hurlbert, Glenn
Formato:	Preprint
Publicado:	2023
Materias:	Combinatorics Discrete Mathematics 05C57 (Primary) 91A43, 05C69, 90B10 (Secondary)
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Cops against a cheating robber
por: Clarke, Nancy E., et al.
Publicado: (2024)

Cops and robbers on $2K_2$-free graphs
por: Turcotte, Jérémie
Publicado: (2020)

Target Pebbling in Trees
por: Adauto, Matheus, et al.
Publicado: (2025)

Eternally surrounding a robber
por: Clarke, Nancy E., et al.
Publicado: (2024)

The Most Malicious Maître D'
por: Madhavarapu, Tejo V.
Publicado: (2024)

Cops and robbers on $P_5$-free graphs
por: Chudnovsky, Maria, et al.
Publicado: (2023)

Cops and robbers on chess graphs
por: Ambrose, Sally, et al.
Publicado: (2025)

Guarding isometric subgraphs and Cops and Robber in planar graphs
por: de la Maza, Sebastián González Hermosillo, et al.
Publicado: (2024)

A New Dominating Set Game on Graphs
por: Fiscus, Sean, et al.
Publicado: (2025)

Improved bounds on the cop number when forbidding a minor
por: Kenter, Franklin, et al.
Publicado: (2023)

Cops and Robbers on Multi-Layer Graphs
por: Enright, Jessica, et al.
Publicado: (2023)

Trail Trap: a variant of Partizan Edge Geography
por: Buchanan, Calum, et al.
Publicado: (2024)

Totally equimodular matrices: decomposition and triangulation
por: Chervet, Patrick, et al.
Publicado: (2025)

4-cop-win graphs have at least 19 vertices
por: Turcotte, Jérémie, et al.
Publicado: (2020)

A cop-robber game on metric graphs
por: Berend, Daniel, et al.
Publicado: (2025)

Optimally reconnecting graphs against an edge-destroying adversary
por: McDonald, Daniel C.
Publicado: (2021)

The independence ratio of 4-cycle-free planar graphs
por: Kelly, Tom, et al.
Publicado: (2023)

On edge-colouring-games by Erdős, and Bensmail and Mc Inerney
por: Cambie, Stijn, et al.
Publicado: (2025)

Burning games on strong path products
por: Ambrose, Sally, et al.
Publicado: (2025)

On corona of Konig-Egervary graphs
por: Levit, Vadim E., et al.
Publicado: (2024)

The Burning Number Conjecture Holds Asymptotically
por: Norin, Sergey, et al.
Publicado: (2022)

Maximal planar graphs that embed as centers
por: Preez, Brandon Du
Publicado: (2024)

Cops and robbers on directed and undirected abelian Cayley graphs
por: Bradshaw, Peter, et al.
Publicado: (2019)

A greedy heuristic for graph burning
por: García-Díaz, Jesús, et al.
Publicado: (2024)

Awesome graph parameters
por: Štorgel, Kenny Bešter, et al.
Publicado: (2025)

Cops and Attacking Robbers with Cycle Constraints
por: Clow, Alexander, et al.
Publicado: (2024)

A note on the Independent domination polynomial of zero divisor graph of rings
por: Rather, Bilal Ahmad
Publicado: (2024)

Large induced forests in planar multigraphs
por: Makarov, Mikhail
Publicado: (2026)

Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets
por: Enami, Kengo, et al.
Publicado: (2025)

Packing coloring of hypercubes with extended Hamming codes
por: Gregor, Petr, et al.
Publicado: (2023)

Thresholds of Queen covers
por: Adhikari, Tirthankar, et al.
Publicado: (2025)

The degree-diameter problem for plane graphs with pentagonal faces
por: Preez, Brandon Du
Publicado: (2024)

Sign games on graphs
por: Blum, Liz, et al.
Publicado: (2025)

The family of all local maximum independent sets is an augmentoid
por: Levit, Vadim E., et al.
Publicado: (2026)

Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$
por: Forcan, Jovana, et al.
Publicado: (2020)

Constructions for positional games and applications to domination games
por: Bagdas, Ali Deniz, et al.
Publicado: (2025)

Cops and Robbers, Clique Covers, and Induced Cycles
por: Clow, Alexander, et al.
Publicado: (2025)

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property
por: Levit, Vadim E., et al.
Publicado: (2024)

Almost Bipartite non-König-Egerváry Graphs Revisited
por: Levit, Vadim E., et al.
Publicado: (2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
por: Dallard, Clément, et al.
Publicado: (2024)