Abstract
The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs defined by geometric representations and competitivity analysis of on-line algorithms. This connection became apparent after the recent construction of triangle-free geometric intersection graphs with arbitrarily large chromatic number due to Pawlik et al. We show that any on-line graph coloring problem gives rise to a class of game graphs, which in many cases have a natural representation by geometric objects. As a consequence, problems of estimating the chromatic number of graphs with geometric representations are reduced to finding on-line coloring algorithms that use few colors or proving that such algorithms do not exist.
We use this framework to derive upper and lower bounds on the maximum possible chromatic number in terms of the clique number in the following classes of graphs: rectangle overlap graphs, subtree overlap graphs and interval filament graphs. These graphs generalize interval overlap graphs (also known as circle graphs)—a well-studied class of graphs with chromatic number bounded by a function of the clique number. Our bounds are absolute for interval filament graphs and asymptotic of the form (loglogn)f(ω) for rectangle and subtree overlap graphs. In particular, we provide the first construction of geometric intersection graphs with bounded clique number and with chromatic number asymptotically greater than loglogn. Moreover, with some additional assumptions on the geometric representation, the bounds obtained are tight.
Full version of this paper is available on-line at arXiv:1402.2437.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asplund, E., Grünbaum, B.: On a colouring problem. Math. Scand. 8, 181–188 (1960)
Enright, J., Stewart, L.: Subtree filament graphs are subtree overlap graphs. Inform. Process. Lett. 104(6), 228–232 (2007)
Felsner, S.: On-line chain partitions of orders. Theoret. Comput. Sci. 175(2), 283–292 (1997)
Fox, J., Pach, J.: Applications of a new separator theorem for string graphs. Combin. Prob. Comput. 23(1), 66–74 (2014)
Gavril, F.: Maximum weight independent sets and cliques in intersection graphs of filaments. Inform. Process. Lett. 73(5-6), 181–188 (2000)
Golumbic, M.C., Rotem, D., Urrutia, J.: Comparability graphs and intersection graphs. Discrete Math. 43(1), 37–46 (1983)
Gyárfás, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math. 55(2), 161–166 (1985); Corrigendum: Discrete Math. 62(3), 333 (1986)
Kostochka, A.: On upper bounds for the chromatic numbers of graphs. Trudy Inst. Mat. 10, 204–226 (1988)
Kostochka, A., Kratochvíl, J.: Covering and coloring polygon-circle graphs. Discrete Math. 163(1-3), 299–305 (1997)
Kostochka, A., Milans, K.: Coloring clean and K 4-free circle graphs. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 399–414. Springer (2012)
Krawczyk, T., Pawlik, A., Walczak, B.: Coloring triangle-free rectangle overlap graphs with O(loglogn) colors, arXiv:1301.0541 (submitted)
Pawlik, A., Kozik, J., Krawczyk, T., Lasoń, M., Micek, P., Trotter, W.T., Walczak, B.: Triangle-free geometric intersection graphs with large chromatic number. Discrete Comput. Geom. 50(3), 714–726 (2013)
Rok, A., Walczak, B.: Outerstring graphs are χ-bounded. In: 30th Annual Symposium on Computational Geometry (SoCG 2014), arXiv:1312.1559 (to appear, 2014)
Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comput. System Sci. 26(3), 362–391 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krawczyk, T., Walczak, B. (2014). Coloring Relatives of Interval Overlap Graphs via On-line Games. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds) Automata, Languages, and Programming. ICALP 2014. Lecture Notes in Computer Science, vol 8572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43948-7_61
Download citation
DOI: https://doi.org/10.1007/978-3-662-43948-7_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43947-0
Online ISBN: 978-3-662-43948-7
eBook Packages: Computer ScienceComputer Science (R0)