A technique for multicoloring triangle-free hexagonal graphs

DOI10.1016/j.disc.2005.06.002zbMath1076.05037MaRDI QIDQ2570123

Sundar Vishwanathan, K. S. Sudeep

Publication date: 26 October 2005

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

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

zbMATH Keywords

Hexagonal graphs; Multicoloring triangular lattice; Triangle-free

Mathematics Subject Classification ID

90B18: Communication networks in operations research

05C15: Coloring of graphs and hypergraphs

Related Items

Tight Lower Bounds for the Complexity of Multicoloring, 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs, On the packing chromatic number of Cartesian products, hexagonal lattice, and trees, On the packing chromatic number of Cartesian products, hexagonal lattice, and trees, A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs], Simpler multicoloring of triangle-free hexagonal graphs, 1-local 7/5-competitive algorithm for multicoloring hexagonal graphs, Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable, 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs, IMPROPER COLORING OF WEIGHTED GRID AND HEXAGONAL GRAPHS

Cites Work

• Finding a five bicolouring of a triangle-free subgraph of the triangular lattice
• Channel assignment and weighted coloring