Improper coloring of weighted grid and hexagonal graphs
From MaRDI portal
Recommendations
- Weighted Improper Colouring
- Weighted improper colouring
- Directed weighted improper coloring for cellular channel allocation
- Channel assignment and weighted coloring
- 2-local <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-competitive algorithm for multicoloring hexagonal graphs
Cites work
- A technique for multicoloring triangle-free hexagonal graphs
- Channel assignment and multicolouring of the induced subgraphs of the triangular lattice
- Channel assignment and weighted coloring
- Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
- Graph labeling and radio channel assignment
- Improper coloring of unit disk graphs
- Improper Colourings of Unit Disk Graphs
Cited in
(11)- Dynamic \(F\)-free coloring of graphs
- Weighted improper colouring
- Directed weighted improper coloring for cellular channel allocation
- Constructive algorithms for the partial directed weighted improper coloring problem
- Weighted Improper Colouring
- Parameterized (approximate) defective coloring
- Parameterized (approximate) defective coloring
- Progress (and lack thereof) for graph coloring approximation problems
- Defective Coloring on Classes of Perfect Graphs
- On the structural parameterized complexity of defective coloring
- Bounds and fixed-parameter algorithms for weighted improper coloring
This page was built for publication: Improper coloring of weighted grid and hexagonal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3063610)
