Independence and Coloring Problems on Intersection Graphs of Disks
From MaRDI portal
Publication:5450806
DOI10.1007/11671541_5zbMath1132.68819OpenAlexW132569744MaRDI 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
Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
Generalized disk graphs ⋮ A tight bound for online colouring of disk graphs ⋮ 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 ⋮ Tight bounds for online coloring of basic graph classes ⋮ Location-oblivious distributed unit disk graph coloring ⋮ Facility location with tree topology and radial distance constraints ⋮ Tight Bounds for Online Coloring of Basic Graph Classes
This page was built for publication: Independence and Coloring Problems on Intersection Graphs of Disks
