IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS

DOI10.1142/S1793830910000747zbMath1201.05034OpenAlexW2158771458MaRDI QIDQ3063610

Frédéric Havet, Jean-Claude Bermond, Cláudia Linhares Sales, Florian Huc

Publication date: 15 December 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000747

zbMATH Keywords

approximation algorithmsgrid graphsimproper coloringhexagonal graphsweighted coloringfrequency allcation problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Dynamic \(F\)-free coloring of graphs ⋮ Unnamed Item ⋮ Parameterized (Approximate) Defective Coloring ⋮ Bounds and fixed-parameter algorithms for weighted improper coloring ⋮ Defective Coloring on Classes of Perfect Graphs

Cites Work

• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• A technique for multicoloring triangle-free hexagonal graphs
• Improper coloring of unit disk graphs
• Improper Colourings of Unit Disk Graphs
• Graph labeling and radio channel assignment
• Channel assignment and weighted coloring
• Channel assignment and multicolouring of the induced subgraphs of the triangular lattice

This page was built for publication: IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS