arXiv (All)
open access
Cop number of $P_k$-free graphs without a claw or a fork
In 2019, Liu proved that the cop number of any $(P_k, claw)$-free graph is at most $k-3$. In 2026, Clow and Meger improved and generalized the result of Liu by showing that every connected $(P_k, E)$-free graph has cop number at most $\lceil \frac{k-1}{2} \rceil + 3$, where the graph $E$ is obtained
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bull-free graphs and $χ$-boundedness#972374
- Edge-spectral Turán theorems for color-critical graphs with applications#1123965
- On the number of edges of restricted matchstick graphs#1327233
- A solution to a conjecture on the signless Laplacian spectral radius for $t$-color-critical graphs#1035773
- Encoding and Enumerating Acyclic Orientations of Graphs#1200707
Record · ID 1355064
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive