Simpler multicoloring of triangle-free hexagonal graphs

DOI10.1016/j.disc.2011.07.031zbMath1233.05107OpenAlexW1990086465MaRDI QIDQ658035

Janez Žerovnik, Petra Šparl, Ignasi Sau

Publication date: 11 January 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.07.031

zbMATH Keywords

Weighted clique number of a graph

Mathematics Subject Classification ID

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

Related Items

A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs], Maximum induced matching of hexagonal graphs, 3-path vertex cover and dissociation number of hexagonal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Every planar map is four colorable. II: Reducibility
• Corrigendum: Static frequency assignment in cellular networks
• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• The four-colour theorem
• 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs
• A technique for multicoloring triangle-free hexagonal graphs
• 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs
• 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs
• 1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
• A 1-Local 13/9-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
• 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