LIPIcs.GD.2024.53.pdf
- Filesize: 0.65 MB
- 3 pages
Document
String Graph with Cop Number 4 (Poster Abstract)
Authors
Myroslav Kryven 
,
-
Part of:
Volume:
32nd International Symposium on Graph Drawing and Network Visualization (GD 2024)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: Graph Drawing and Network Visualization (GD) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2024-10-28
File
Document Identifiers
Author Details
Cite AsGet BibTex
Stephane Durocher, Myroslav Kryven, and Maarten Löffler. String Graph with Cop Number 4 (Poster Abstract). In 32nd International Symposium on Graph Drawing and Network Visualization (GD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 320, pp. 53:1-53:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.GD.2024.53
https://doi.org/10.4230/LIPIcs.GD.2024.53
Abstract
Cops and Robbers is a well-studied pursuit-evasion game in which a set of cops seeks to catch a robber in a graph G, where cops and the robber move along edges of G. The cop number of G is the minimum number of cops that is sufficient to catch the robber. The game of Cops and Robbers has been well-studied on beyond-planar graphs (that is, graphs that can be drawn with only few crossings) [M. Aigner and M. Fromme, 1984; Durocher et al., 2023] as well as intersection graphs (that is, graphs where the vertices represent geometric objects, and an edge exists between two vertices if the corresponding objects intersect). We consider a well-known subclass of intersection graphs called string graphs where the objects are curves. So far no string graph with cop number larger than three was known. We construct the first string graph with cop number four, which improves the previous bound and answers an open question by Gavenčiak et al. [Tomáš Gavenčiak et al., 2018].
Subject Classification
ACM Subject Classification
- Theory of computation → Graph algorithms analysis
Keywords
- point set embedding
- upward planar path embedding
- dynamic programming
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- M. Aigner and M. Fromme. A game of cops and robbers. Discrete Applied Mathematics, 8(1):1-12, 1984. URL: https://doi.org/10.1016/0166-218X(84)90073-8.
-
A. Bonato and R.J. Nowakowski. The Game of Cops and Robbers on Graphs. Student mathematical library. American Mathematical Society, 2011.
- Petr Chmel and Vít Jelínek. String Graphs with Precise Number of Intersections. In 31st International Symposium on Graph Drawing and Network Visualization, pages 78-92, Berlin, Heidelberg, 2024. Springer-Verlag. URL: https://doi.org/10.1007/978-3-031-49272-3_6.
- Stephane Durocher, Shahin Kamali, Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, and Timothy Zapp. Cops and robbers on 1-planar graphs. In Michael A. Bekos and Markus Chimani, editors, Graph Drawing and Network Visualization (GD), volume 14466 of LNCS, pages 3-17. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-49275-4_1.
- Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek, Pavel Klavík, and Jan Kratochvíl. Cops and robbers on intersection graphs. European Journal of Combinatorics, 72:45-69, 2018. URL: https://doi.org/10.1016/j.ejc.2018.04.009.
- Jan Kratochvíl and Jiří Matoušek. Intersection graphs of segments. Journal of Combinatorial Theory, Series B, 62(2):289-315, 1994. URL: https://doi.org/10.1006/jctb.1994.1071.
- Richard J. Nowakowski and Peter Winkler. Vertex-to-vertex pursuit in a graph. Discrete Mathematics, 43:235-239, 1983. URL: https://doi.org/10.1016/0012-365X(83)90160-7.
-
Alain Quilliot. Jeux et pointes fixes sur les graphes. PhD thesis, Université de Paris VI, 1978.
- Anonymus User and Misha Lavrov. String graph with girth 5 and min degree 4. Math Stack Exchange, 2017. URL: https://math.stackexchange.com/questions/2241951/string-graph-with-girth-5-and-min-degree-4.