A note on online colouring problems in overlap graphs and their complements

DOI10.1007/978-3-319-75172-6_13zbMath1498.68201OpenAlexW2789027801MaRDI QIDQ1641110

Martin Olsen, Marc Demange

Publication date: 15 June 2018

Full work available at URL: https://pure.au.dk/ws/files/124884396/A_Note_on_Online_Colouring_Problems_in_Overlap_Graphs_and_Their.pdf

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Online algorithms; streaming algorithms (68W27)

Related Items (2)

An asymptotically optimal algorithm for online stacking ⋮ Generalised online colouring problems in overlap graphs

This page was built for publication: A note on online colouring problems in overlap graphs and their complements