Cover Image

Graphs with Large Girth and Small Cop Number

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Clow, Alexander
Format:	Preprint
Published:	2023
Subjects:	Combinatorics 05C57 (Primary) 05C48, 05D40 (Secondary) G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Log-concavity of the independence polynomials of $\mathbf{W}_{p}$ graphs
by: Hoang, Do Trong, et al.
Published: (2024)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
by: Koutsoutis, Alex, et al.
Published: (2025)

Expanders Satisfy the Weak Meyniel Conjecture
by: Clow, Alexander
Published: (2023)

Forbidden paths and cycles in the undirected underlying graph of a 2-quasi best match graph
by: Korchmaros, Annachiara
Published: (2024)

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

On 1-Konig-Egervary Graphs
by: Levit, Vadim E., et al.
Published: (2023)

Hypertrees and their host trees: a survey
by: Di Fonzo, Pablo De Caria
Published: (2025)

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
by: Lalou, Mohammed, et al.
Published: (2025)

Cops and Robbers on Graphs with Path Constraints
by: Clow, Alexander, et al.
Published: (2025)

Digraphs of potential barriers: properties of their tree structure and algorithm for constructing minimum spanning forests
by: Buslov, Vasily
Published: (2025)

When a forest, narrowed to an atom of subset algebra, turns out to be a tree
by: Buslov, Vasily
Published: (2025)

On the distance signless Laplacian spectral radius, fractional matching and factors of graphs
by: Zhang, Z. H., et al.
Published: (2025)

Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
by: Buslov, Vasily
Published: (2025)

How Trees on Atoms of Subset Algebras Define Minimal Forests and Their Growth
by: Buslov, Vasily
Published: (2025)

Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
by: Buslov, V. A.
Published: (2025)

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

Distance Critical Graphs
by: Cooper, Joshua, et al.
Published: (2024)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

The Lights Out Game on Directed Graphs
by: Dettling, T. Elise, et al.
Published: (2023)

Simultaneous edge-colourings
by: Boyadzhiyska, Simona, et al.
Published: (2024)

The Combinatorial Rank of Subsets: Metric Density in Finite Hamming Spaces
by: Abdurakhmanov, Jamolidin K.
Published: (2025)

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

Separating Matchings in Cubic Graphs
by: Gutiérrez, Juan, et al.
Published: (2026)

Polynomial Reconstruction Problem for Hypergraphs
by: Cooper, Joshua, et al.
Published: (2023)

Independent Set Enumeration and Estimation of Related Constants of Grid Graphs and Their Variants
by: Liang, Kai
Published: (2025)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

Slavic Techniques for Hat Guessing Algorithms
by: McInnis, I. M. J.
Published: (2025)

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

Robust Hamiltonicity
by: Joos, Felix, et al.
Published: (2023)

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

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

Bounds and Hardness Results for Conflict-free Choosability
by: Gupta, Shiwali, et al.
Published: (2024)

Prime Square Order Cayley Graph of Cyclic Groups of Particular Valency
by: Atmaja, Iqbal, et al.
Published: (2026)

Increasingly Many Bounded Eigenvalues of the Graph of Whitehead Moves
by: Li, Michael
Published: (2024)

Oriented Colouring Graphs of Bounded Degree and Degeneracy
by: Clow, Alexander, et al.
Published: (2023)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

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

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

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

A Generalization of the Graham-Pollak Tree Theorem to Even-Order Steiner Distance
by: Cooper, Joshua, et al.
Published: (2024)