On the span of distance coloring of infinite hexagonal grid

DOI10.1142/S012905412350020XMaRDI QIDQ6629663FDOQ6629663

Authors Subhasis Koley, Sasthi C. Ghosh 

Publication date 30 October 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

channel assignment problemspandistance coloringinfinite hexagonal grid

Mathematics Subject Classification ID

Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Distance Coloring of the Hexagonal Lattice
• Theoretical Computer Science
• Optimal \(L(h,k)\)-labeling of regular grids
• A technique for multicoloring triangle-free hexagonal graphs
• On \(L'(2, 1)\)-edge coloring number of regular grids

Cites Work

• A note on \(S\)-packing colorings of lattices
• A survey on the distance-colouring of graphs
• Channel assignment for interference avoidance in honeycomb wireless networks
• Distance Coloring of the Hexagonal Lattice
• Subdivision into \(i\)-packings and \(S\)-packing chromatic number of some lattices
• Theoretical Computer Science

This page was built for publication: On the span of \(\ell\) distance coloring of infinite hexagonal grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6629663)