Cover Image

Blind cop-width and balanced minors of graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buffière, Hector, Campbell, Rutger, Hendrey, Kevin, Oum, Sang-il
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Unavoidable pivot-minors in graphs of large rank-depth
by: Ahn, Jungho, et al.
Published: (2025)

Linear bounds on treewidth in terms of excluded planar minors
by: Gollin, J. Pascal, et al.
Published: (2024)

Twin-width of random graphs
by: Ahn, Jungho, et al.
Published: (2022)

Prime vertex-minors of a prime graph
by: Kim, Donggyu, et al.
Published: (2022)

Twin-width of subdivisions of multigraphs
by: Ahn, Jungho, et al.
Published: (2023)

The Erdős-Pósa property for circle graphs as vertex-minors
by: Campbell, Rutger, et al.
Published: (2025)

Metric graphs of negative type
by: Campbell, Rutger, et al.
Published: (2025)

Fragile minor-monotone parameters under random edge perturbation
by: Kang, Dong Yeap, et al.
Published: (2020)

A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
by: Gollin, J. Pascal, et al.
Published: (2022)

Note on Hamiltonicity of basis graphs of even delta-matroids
by: Kim, Donggyu, et al.
Published: (2023)

Characterization of cycle obstruction sets for improper coloring planar graphs
by: Choi, Ilkyoo, et al.
Published: (2018)

A unified half-integral Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
by: Gollin, J. Pascal, et al.
Published: (2021)

Ramsey-type $χ$-bounds for $χ$-bounded graph classes
by: Nguyen, Tung, et al.
Published: (2026)

Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
by: Ahn, Jungho, et al.
Published: (2022)

Twin‐width of random graphs
by: Jungho Ahn, et al.
Published: (2024)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
by: Oum, Sang-il, et al.
Published: (2026)

Binary matroids and degree-boundedness for pivot-minors
by: Campbell, Rutger, et al.
Published: (2025)

Shallow vertex minors, stability, and dependence
by: Buffière, H., et al.
Published: (2024)

Decomposing graphs into stable and ordered parts
by: Buffière, Hector, et al.
Published: (2025)

Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
by: Kanté, Mamadou Mostapha, et al.
Published: (2021)

Branch-width of represented matroids in matrix multiplication time
by: Choi, Mujin, et al.
Published: (2026)

On weak cop numbers of transitive graphs
by: Lehner, Florian
Published: (2025)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

Sharing tea on a graph
by: Gollin, J. Pascal, et al.
Published: (2024)

Optimal bounds for zero-sum cycles. I. Odd order
by: Campbell, Rutger, et al.
Published: (2024)

Rainbow saturation for complete graphs
by: Chakraborti, Debsoumya, et al.
Published: (2022)

The excluded minors of the class of spike minors
by: Bastida, Sam, et al.
Published: (2025)

Coarse cops and robber in graphs and groups
by: Esperet, Louis, et al.
Published: (2025)

Clustered Colouring of Odd-$H$-Minor-Free Graphs
by: Hickingbotham, Robert, et al.
Published: (2023)

Reuniting $χ$-boundedness with polynomial $χ$-boundedness
by: Chudnovsky, Maria, et al.
Published: (2023)

Finding dense minors using average degree
by: Hendrey, Kevin, et al.
Published: (2023)

Classification of real Bott manifolds and acyclic digraphs
by: Choi, Suyoung, et al.
Published: (2010)

Clustered Colouring of Graph Products
by: Campbell, Rutger, et al.
Published: (2024)

Many equiprojective polytopes
by: Buffière, Théophile, et al.
Published: (2023)

Complexity results for a cops and robber game on directed graphs
by: Ben-Ameur, Walid, et al.
Published: (2024)

Optimal Tree-Decompositions with Bags of Bounded Treewidth
by: Hendrey, Kevin, et al.
Published: (2025)

Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)

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