Abstract
A family of sets in the plane is simple if the intersection of its any subfamily is arcwise connected. We prove that the intersection graphs of simple families of compact arcwise connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number.
Supported by the Ministry of Science and Higher Education of Poland under grant no. 884/N-ESF-EuroGIGA/10/2011/0 within the ESF EuroGIGA project GraDR
Partially supported by Swiss National Science Foundation Grant no. 200020-144531
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
E. Asplund and B. Grünbaum, On a colouring problem, Math. Scand. 8 (1960), 181–188.
J. P. Burling, “On Coloring Problems of Families of Prototypes”, PhD thesis, University of Colorado, 1965.
A. Gyárfás, On the chromatic number of multiple interval graphs and overlap graphs, Discrete Math. 55(2) (1985), 161–166. Corrigendum: Discrete Math. 62 (3) (1986), 333.
A. Kostochka and J. Kratochvíl, Covering and coloring polygon-circle graphs, Discrete Math. 163(1–3) (1997), 299–305.
S. McGuinness, On bounding the chromatic number of L-graphs, Discrete Math. 154(1–3) (1996), 179–187.
S. McGuinness, Colouring arcwise connected sets in the plane I, Graph. Combin. 16(4) (2000), 429–439.
A. Pawlik, J. Kozik, T. Krawczyk, M. Lasoń, P. Micek, W. T. Trotter and B. Walczak, Triangle-free intersection graphs of line segments with large chromatic number, submitted, arXiv:1209.1595.
A. Suk, Coloring intersection graphs of x-monotone curves in the plane, Combinatorica, to appear, arXiv:1201.0887.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2013 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Lasoń, M., Micek, P., Pawlik, A., Walczak, B. (2013). Coloring intersection graphs of arcwise connected sets in the plane. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_48
Download citation
DOI: https://doi.org/10.1007/978-88-7642-475-5_48
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-474-8
Online ISBN: 978-88-7642-475-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)