Improper coloring of unit disk graphs
From MaRDI portal
Recommendations
Cites work
- An optimal greedy heuristic to color interval graphs
- Channel assignment and weighted coloring
- Defective coloring revisited
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Every planar graph is 5-choosable
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 1256776 (Why is no real title available?)
- scientific article; zbMATH DE number 1250667 (Why is no real title available?)
- scientific article; zbMATH DE number 1769307 (Why is no real title available?)
- scientific article; zbMATH DE number 1865936 (Why is no real title available?)
- Improper colouring of (random) unit disk graphs
- Improper Colourings of Unit Disk Graphs
- List colourings of planar graphs
- List Improper Colourings of Planar Graphs
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- On coloring unit disk graphs
- Random channel assignment in the plane
- Robust algorithms for restricted domains
- Simple heuristics for unit disk graphs
- Static frequency assignment in cellular networks
- Unit disk graphs
Cited in
(30)- On coloring unit disk graphs
- Dynamic \(F\)-free coloring of graphs
- On \(t\)-relaxed 2-distant circular coloring of graphs
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree
- Approximate strong edge-colouring of unit disk graphs
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
- The complexity of dissociation set problems in graphs
- Channel assignment problem and relaxed 2-distant coloring of graphs
- Improper colouring of (random) unit disk graphs
- Improper coloring of weighted grid and hexagonal graphs
- Weighted Improper Colouring
- Parameterized (approximate) defective coloring
- Faster computation of the maximum dissociation set and minimum 3-path vertex cover in graphs
- Improper colouring of (random) unit disk graphs
- On t-relaxed chromatic number of r-power paths
- Note on coloring of double disk graphs
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
- Parameterized complexity of fair vertex evaluation problems
- Parameterized (approximate) defective coloring
- Defective Coloring on Classes of Perfect Graphs
- Graph-Theoretic Concepts in Computer Science
- Maximum weight t-sparse set problem on vector-weighted graphs
- Maximum dissociation sets in subcubic trees
- Graph partitions under average degree constraint
- Minimum number of maximal dissociation sets in trees
- Improper C-colorings of graphs
- The minimum number of maximal dissociation sets in unicyclic graphs
- Structural parameterizations for two bounded degree problems revisited
- Tree decompositions meet induced matchings: beyond max weight independent set
This page was built for publication: Improper coloring of unit disk graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057115)
