Coloring a set of touching strings

DOI10.1016/J.ENDM.2009.07.035MaRDI QIDQ2851465zbMATH OpenOpenAlexFDO

Authors L. Esperet, Daniel Gonçalves, Arnaud Labourel

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

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring non-crossing strings
• Coloring Jordan regions and curves
• Colouring arcwise connected sets in the plane. I
• On The Chromatic Number of Geometric Hypergraphs
• On the chromatic number of disjointness graphs of curves

Cites work

• A unified approach to distance-two colouring of graphs on surfaces
• Coloring k _k -free intersection graphs of geometric objects in the plane
• Coloring relatives of intervals on the plane. I: Chromatic number versus girth
• Colouring arcwise connected sets in the plane. I
• Covering and coloring polygon-circle graphs
• Covering and coloring problems for relatives of intervals
• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• scientific article; zbMATH DE number 4108789 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• On a Coloring Problem.

Cited in

(4)

• Coloring Jordan regions and curves
• Colouring arcwise connected sets in the plane. I
• On tangencies among planar curves with an application to coloring L-shapes
• Coloring non-crossing strings

This page was built for publication: Coloring a set of touching strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851465)