Distance Coloring of the Hexagonal Lattice

DOI10.7151/DMGT.1269MaRDI QIDQ5316269zbMATH OpenOpenAlexFDO

Authors Peter Jacko, Stanislav Jendroľ

Publication date 12 September 2005

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://eprints.lancs.ac.uk/id/eprint/71359/1/Article_cameraready.pdf

zbMATH Keywords

hexagonal gridhexagonal tilingdistant chromatic numberradio channel frequency assignment

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The chromatic numbers of distance graphs
• Integral distance graphs
• On the packing chromatic number of square and hexagonal lattice
• (d, n)-packing colorings of infinite lattices
• Distance graphs and \(T\)-coloring

Cited in

(8)

• Tiling the plane with hexagons: improved separations for k-colourings
• The distance coloring of graphs
• Coloring of the \(d^{\text{th}}\) power of the face-centered cubic grid
• On the span of distance coloring of infinite hexagonal grid
• Exact distance colouring in trees
• A survey on the distance-colouring of graphs
• A note on \(S\)-packing colorings of lattices
• On the Optimality of Coloring with a Lattice

This page was built for publication: Distance Coloring of the Hexagonal Lattice

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