On the minimum order of 4-lazy cops-win graphs
We consider the minimum order of a graph G with a given lazy cop number c L (G). Sullivan, Townsend and Werzanski [7] showed that the minimum order of a connected graph with lazy cop number 3 is 9 and K 3 □K 3 is the unique graph on nine vertices which requires three lazy cops. They conjectured that...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Korean Mathematical Society
2018
|
| Subjects: | |
| Online Access: | http://eprints.um.edu.my/20660/ http://pdf.medrang.co.kr/kms01/BKMS/55/BKMS-55-6-1667-1690.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|