1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs

DOI10.1016/j.endm.2010.05.048zbMath1236.05198OpenAlexW2168480269MaRDI QIDQ2883583

Janez Žerovnik, Rafał Witkowski

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.048

zbMATH Keywords

hexagonal graphfrequency assignmentmulticoloring

Mathematics Subject Classification ID

Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (1)

Simpler multicoloring of triangle-free hexagonal graphs

Cites Work

• A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
• A technique for multicoloring triangle-free hexagonal graphs
• 1-Local 17/12-Competitive Algorithm for Multicoloring 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
• Static frequency assignment in cellular networks

This page was built for publication: 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs