A technique for multicoloring triangle-free hexagonal graphs

DOI10.1016/j.disc.2005.06.002zbMath1076.05037OpenAlexW2064369194MaRDI 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 graphsMulticoloring triangular latticeTriangle-free

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

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 ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ A linear time algorithm for \(7\)-\([3\)coloring triangle-free hexagonal graphs] ⋮ Simpler multicoloring of triangle-free hexagonal graphs ⋮ 2-local 7/6-competitive algorithm for multicolouring a sub-class of hexagonal graphs ⋮ IMPROPER COLORING OF WEIGHTED GRID AND 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

Cites Work

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

This page was built for publication: A technique for multicoloring triangle-free hexagonal graphs