The following pages link to On coloring unit disk graphs (Q1386337):
Displaying 38 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- On the chromatic number of random geometric graphs (Q663092) (← links)
- Minimum ply covering of points with disks and squares (Q827338) (← links)
- Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks (Q1019740) (← links)
- Conflict-free coloring of unit disks (Q1028125) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Unit disk graphs (Q1174134) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- 3-coloring arrangements of line segments with 4 slopes is hard (Q1641160) (← links)
- Graph imperfection. I (Q1850556) (← links)
- The on-line first-fit algorithm for radio frequency assignment problems. (Q1853136) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- \( L ( 2 , 1 )\)-labeling of disk intersection graphs (Q2306585) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← links)
- The number of disk graphs (Q2509768) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- Approximating maximum diameter-bounded subgraph in unit disk graphs (Q2665266) (← links)
- Clique number and ball containment number of unit ball graphs (Q2816018) (← links)
- Multicoloring unit disk graphs on triangular lattice points (Q2921755) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- Improper Colourings of Unit Disk Graphs (Q3439320) (← links)
- Bisectored unit disk graphs (Q4474290) (← links)
- On the chromatic number of disk graphs (Q4540061) (← links)
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs (Q4568089) (← links)
- Fine-grained complexity of coloring unit disks and balls (Q4580091) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (Q5189993) (← links)
- On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs (Q5283382) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5925586) (← links)
- On embeddability of unit disk graphs onto straight lines (Q6038709) (← links)
- Online dominating set and coloring (Q6606165) (← links)
