Independence and Coloring Problems on Intersection Graphs of Disks
From MaRDI portal
Publication:5450806
DOI10.1007/11671541_5zbMath1132.68819MaRDI QIDQ5450806
Publication date: 14 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671541_5
68R10: Graph theory (including graph drawing) in computer science
68-02: Research exposition (monographs, survey articles) pertaining to computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Location-oblivious distributed unit disk graph coloring, Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs, Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes, A tight bound for online colouring of disk graphs