Coloring k k -free intersection graphs of geometric objects in the plane
From MaRDI portal
Publication:3602935
DOI10.1145/1377676.1377735zbMath1271.05032OpenAlexW2076743027MaRDI QIDQ3602935
Publication date: 12 February 2009
Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1377676.1377735
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
k-Quasi-Planar Graphs ⋮ Tangencies between families of disjoint regions in the plane ⋮ Many disjoint edges in topological graphs ⋮ String graphs and incomparability graphs ⋮ Coloring intersection graphs of \(x\)-monotone curves in the plane ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Unnamed Item ⋮ A Separator Theorem for String Graphs and Its Applications ⋮ Maximum Independent Set in 2-Direction Outersegment Graphs ⋮ Coloring a set of touching strings ⋮ 2-Layer k-Planar Graphs
This page was built for publication: Coloring k k -free intersection graphs of geometric objects in the plane