Colouring arcwise connected sets in the plane. I

DOI10.1007/PL00007228zbMath0984.05034OpenAlexW4252878397MaRDI QIDQ5935603

Sean McGuinness

Publication date: 2 May 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00007228

zbMATH Keywords

intersection graphchromatic numberarcwise connected setdendritetriangle-free

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (21)

Cops and robbers on intersection graphs ⋮ Coloring curves that cross a fixed curve ⋮ Triangle-free intersection graphs of line segments with large chromatic number ⋮ Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Coloring triangle-free L-graphs with \(O (\log \log n)\) colors ⋮ New bounds on the maximum number of edges in \(k\)-quasi-planar graphs ⋮ Coloring intersection graphs of arc-connected sets in the plane ⋮ Arcwise connected domains, quasiconformal mappings, and quasidisks ⋮ Coloring intersection graphs of \(x\)-monotone curves in the plane ⋮ Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors ⋮ Triangle-free geometric intersection graphs with no large independent sets ⋮ Conflict-free coloring of string graphs ⋮ Unnamed Item ⋮ Coloring non-crossing strings ⋮ Improved Ramsey-type results for comparability graphs ⋮ On the chromatic number of disjointness graphs of curves ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Coloring a set of touching strings

This page was built for publication: Colouring arcwise connected sets in the plane. I