On tangencies among planar curves with an application to coloring L-shapes

DOI10.1016/j.ejc.2023.103837zbMATH Open1548.05103MaRDI QIDQ6612513

Eyal Ackerman, Balázs Keszegh, Dömötör Pálvölgyi

Publication date: 30 September 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

string graphsconflict-free coloringcircle graphs\(k\)-CF coloringgrounded L-shapes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intersection graphs of L-shapes and segments in the plane
• Triangle-free intersection graphs of line segments with large chromatic number
• Tangencies between families of disjoint regions in the plane
• On pseudo-disk hypergraphs
• On the number of touching pairs in a set of planar curves
• On bounding the chromatic number of L-graphs
• Conflict-free coloring of string graphs
• On grounded \(\llcorner\)-graphs and their relatives
• On a conjecture of Károly Bezdek and János Pach
• Conflict-free coloring of points and simple regions in the plane
• Kontaktprobleme der konformen Abbildung.
• Topological Hypergraphs
• On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
• Conflict-Free Coloring and its Applications

This page was built for publication: On tangencies among planar curves with an application to coloring L-shapes