On coloring unit disk graphs
From MaRDI portal
Publication:1386337
DOI10.1007/PL00009196zbMath0901.68152MaRDI QIDQ1386337
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
Related Items
On the minimum and maximum selective graph coloring problems in some graph classes, Minimum ply covering of points with disks and squares, On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs, On some applications of the selective graph coloring problem, 3-coloring arrangements of line segments with 4 slopes is hard, Inverse chromatic number problems in interval and permutation graphs, Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs, A tight bound for online colouring of disk graphs, Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs, Approximating maximum diameter-bounded subgraph in unit disk graphs, On embeddability of unit disk graphs onto straight lines, Local 7-coloring for planar subgraphs of unit disk graphs, Note on coloring of double disk graphs, On the chromatic number of random geometric graphs, Coloring the complements of intersection graphs of geometric figures, Location-oblivious distributed unit disk graph coloring, LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS, Improper coloring of unit disk graphs, The number of disk graphs, Distributed coloring and the local structure of unit-disk graphs, Distributed coloring and the local structure of unit-disk graphs, Clique number and ball containment number of unit ball graphs, Maximum scan statistics and channel assignment problems in homogeneous wireless networks, \( L ( 2 , 1 )\)-labeling of disk intersection graphs, Perfectness and imperfectness of unit disk graphs on triangular lattice points, Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs, Graph imperfection. I, The on-line first-fit algorithm for radio frequency assignment problems., Improper Colourings of Unit Disk Graphs
