On coloring unit disk graphs
From MaRDI portal
Publication:1386337
DOI10.1007/PL00009196zbMATH Open0901.68152MaRDI QIDQ1386337FDOQ1386337
Authors: D. Massart 
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Cited In (39)
- A tight bound for online colouring of disk graphs
- Location-oblivious distributed unit disk graph coloring
- On the minimum and maximum selective graph coloring problems in some graph classes
- Minimum ply covering of points with disks and squares
- Multicoloring unit disk graphs on triangular lattice points
- Improper Colourings of Unit Disk Graphs
- Local 7-coloring for planar subgraphs of unit disk graphs
- Fine-grained complexity of coloring unit disks and balls
- Improper coloring of unit disk graphs
- Coloring the complements of intersection graphs of geometric figures
- A lower bound on the area of a 3-coloured disk packing
- Graph imperfection. I
- On embeddability of unit disk graphs onto straight lines
- Bisectored unit disk graphs
- The on-line first-fit algorithm for radio frequency assignment problems.
- Distributed coloring and the local structure of unit-disk graphs
- Online dominating set and coloring
- 3-coloring arrangements of line segments with 4 slopes is hard
- Inverse chromatic number problems in interval and permutation graphs
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks
- Title not available (Why is that?)
- On some applications of the selective graph coloring problem
- Title not available (Why is that?)
- Distributed coloring and the local structure of unit-disk graphs
- Note on coloring of double disk graphs
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes
- Fine-grained complexity of coloring unit disks and balls
- Perfectness and imperfectness of unit disk graphs on triangular lattice points
- On the exact complexity of Hamiltonian Cycle and \(q\)-Colouring in disk graphs
- The number of disk graphs
- Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs
- Conflict-free coloring of unit disks
- Clique number and ball containment number of unit ball graphs
- On the chromatic number of random geometric graphs
- Local construction and coloring of spanners of location aware unit disk graphs
This page was built for publication: On coloring unit disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386337)
