Coloring triangle-free rectangular frame intersection graphs with O( n) colors

DOI10.1007/978-3-642-45043-3_29MaRDI QIDQ2864313zbMATH OpenOpenAlexFDO

Authors Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak

Publication date 6 December 2013

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45043-3_29

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
• On-line approach to off-line coloring problems on graphs with geometric representations
• Triangle-free geometric intersection graphs with large chromatic number
• Triangle-free intersection graphs of line segments with large chromatic number

Cited in

(6)

• Colouring triangle-free intersection graphs of boxes on the plane
• Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
• Triangle-free geometric intersection graphs with large chromatic number
• Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
• Coloring triangle-free L-graphs with O( n) colors
• Polynomial-time recognition and maximum independent set in Burling graphs

This page was built for publication: Coloring triangle-free rectangular frame intersection graphs with \(O(\log \log n)\) colors

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