On the span of distance coloring of infinite hexagonal grid
From MaRDI portal
Publication:6629663
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)
Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- A survey on the distance-colouring of graphs
- A note on \(S\)-packing colorings of lattices
- Subdivision into \(i\)-packings and \(S\)-packing chromatic number of some lattices
- Theoretical Computer Science
- Channel assignment for interference avoidance in honeycomb wireless networks
- Distance Coloring of the Hexagonal Lattice
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)
