Search papers, labs, and topics across Lattice.
Affiliation:
1
0
The cop number of $(P_k, claw)$-free graphs is proven to be at most $\lceil \frac{k-1}{2} \rceil$, a significant improvement over existing bounds.