Coloring a set of touching strings
From MaRDI portal
Publication:2851465
DOI10.1016/j.endm.2009.07.035zbMath1273.05066OpenAlexW2071287219MaRDI QIDQ2851465
Louis Esperet, Arnaud Labourel, Daniel Gonçalves
Publication date: 10 October 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.035
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering and coloring problems for relatives of intervals
- Covering and coloring polygon-circle graphs
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth
- A unified approach to distance-two colouring of graphs on surfaces
- On a Coloring Problem.
- Coloring k k -free intersection graphs of geometric objects in the plane
- Colouring arcwise connected sets in the plane. I
This page was built for publication: Coloring a set of touching strings
