Coloring non-crossing strings
From MaRDI portal
Publication:727171
zbMath1351.05073arXiv1511.03827MaRDI QIDQ727171
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
Publication date: 6 December 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.03827
Related Items (2)
Coloring Jordan Regions and Curves ⋮ Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangle-free intersection graphs of line segments with large chromatic number
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Barycentric systems and stretchability
- Covering and coloring problems for relatives of intervals
- Classes and recognition of curve contact graphs
- Covering and coloring polygon-circle graphs
- The maximal clique and colourability of curve contact graphs
- Planar graphs of maximum degree seven are Class I
- A unified approach to distance-two colouring of graphs on surfaces
- Coloring a set of touching strings
- On a Coloring Problem.
- Bar k-Visibility Graphs
- Parameters of Bar k-Visibility Graphs
- Colouring arcwise connected sets in the plane. I
This page was built for publication: Coloring non-crossing strings
