The following pages link to (Q5708492):
Displaying 9 items.
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- (Q5088986) (← links)