String graph with cop number 4
We construct a 1-string graph with minimum degree four and girth five. And thus its cop number is at least four. This answers an open question by Gavenčiak et al.
keywords: GAME, Graph Drawing, Graphs Theory
Workshop or Poster (weakly reviewed)
Maarten Löffler, Myroslav Kryven, Stephane Durocher
String graph with cop number 4
Proc. 44th Symposium on Graph Drawing
(to appear), 2024
back to list
