Copertina

4K_1 free graphs on 13 vertices have cop number at most 2

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Wu, Zhaoyu
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

$4K_1$-free graph with the cop number $3$
di: Char, Arnab, et al.
Pubblicazione: (2025)

On weak cop numbers of transitive graphs
di: Lehner, Florian
Pubblicazione: (2025)

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

The Lamplighter groups have infinite weak cop number
di: Cornect, Anders, et al.
Pubblicazione: (2024)

K_4-free graphs have sparse halves
di: Reiher, Christian
Pubblicazione: (2021)

Blind cop-width and balanced minors of graphs
di: Buffière, Hector, et al.
Pubblicazione: (2025)

On the cop number and the weak Meyniel conjecture for algebraic graphs
di: Biswas, Arindam, et al.
Pubblicazione: (2023)

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

The minimum number of distinct eigenvalues of a threshold graph is at most $4$
di: Allem, Luiz Emilio, et al.
Pubblicazione: (2025)

Triangle-free $d$-degenerate graphs have small fractional chromatic number
di: Martinsson, Anders
Pubblicazione: (2025)

The maximum number of triangles in $K_{1,s,t}$-free graphs
di: Calbet, Asier, et al.
Pubblicazione: (2025)

The largest $K_r$-free set of vertices in a random graph
di: Bohman, Tom, et al.
Pubblicazione: (2026)

Trisimplicial vertices in (fork, odd parachute)-free graphs
di: Lan, Kaiyang, et al.
Pubblicazione: (2025)

On cubic graphs having the maximal coalition number
di: Dobrynin, Andrey A., et al.
Pubblicazione: (2024)

Orientations of graphs with at most one directed path between every pair of vertices
di: Dohnalová, Barbora, et al.
Pubblicazione: (2024)

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

On the number of maximal independent sets and maximal induced bipartite subgraphs in $K_4$-free graphs
di: Hartel, Thilo, et al.
Pubblicazione: (2025)

$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$
di: Pohoata, Cosmin, et al.
Pubblicazione: (2026)

Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
di: Tian, Tao, et al.
Pubblicazione: (2026)

On the number of triangles in $K_4$-free graphs
di: He, Jialin, et al.
Pubblicazione: (2025)

The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices
di: Hei, Doudou, et al.
Pubblicazione: (2025)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
di: Chakraborty, Dibyayan
Pubblicazione: (2025)

A closure for Hamilton-connectedness in $\{K_{1,3},Γ_3\}$-free graphs
di: Kabela, Adam, et al.
Pubblicazione: (2024)

A characterization of graphs with at most four boundary vertices
di: Chiem, Nick, et al.
Pubblicazione: (2022)

Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
di: Chudnovsky, Maria, et al.
Pubblicazione: (2024)

Lower bounds on the independence numbers of distance graphs with vertices in $\{-1, 0, 1\}^n$
di: Akhiiarov, A. R., et al.
Pubblicazione: (2024)

Balanced bipartite distance of $K_4$-free graphs
di: Balogh, József, et al.
Pubblicazione: (2026)

On the local metric dimension of $K_4$-free graphs
di: Ghalavand, Ali, et al.
Pubblicazione: (2025)

Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected
di: Kabela, Adam, et al.
Pubblicazione: (2024)

Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
di: Lo, On-Hei Solomon, et al.
Pubblicazione: (2023)

On the unicyclic graphs having vertices that belong to all their (strong) metric bases
di: Hakanen, Anni, et al.
Pubblicazione: (2022)

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

Tipsy cop and tipsy robber: collisions of biased random walks on graphs
di: Harris, Pamela E., et al.
Pubblicazione: (2022)

The perfect divisibility and chromatic number of some odd hole-free graphs
di: He, Weihua, et al.
Pubblicazione: (2026)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
di: Das, Sandip, et al.
Pubblicazione: (2023)

The number of cut-edges and conflict-free connection number in planar graphs
di: Ha, Pham Hoang, et al.
Pubblicazione: (2026)

Spanning trees of claw-free graphs with few leaves and branch vertices
di: Ha, Pham Hoang, et al.
Pubblicazione: (2025)

Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
di: Shao, Sihong, et al.
Pubblicazione: (2025)

Subcubic $K_4$-minor-free graphs without crumby colorings
di: Pintér, József
Pubblicazione: (2026)

Turán numbers of $r$-graphs on $r+1$ vertices
di: Sidorenko, Alexander
Pubblicazione: (2022)