A linear time algorithm for \(7\)-\([3]\)coloring triangle-free hexagonal graphs

DOI10.1016/j.ipl.2012.02.008zbMath1243.05087MaRDI QIDQ436606

Rafał Witkowski, Janez Žerovnik, Petra Šparl

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.02.008

zbMATH Keywords

graph algorithm; approximation algorithm; hexagonal graph; multicoloring; frequency planning

Mathematics Subject Classification ID

90B18: Communication networks in operations research

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

Cites Work

• Simpler multicoloring of triangle-free hexagonal graphs
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
• A technique for multicoloring triangle-free hexagonal graphs
• Distributed Online Frequency Assignment in Cellular Networks
• 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
• 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs
• Static frequency assignment in cellular networks
• Channel assignment and multicolouring of the induced subgraphs of the triangular lattice