Pattern periodic coloring of distance graphs
From MaRDI portal
Publication:1127883
DOI10.1006/jctb.1998.1831zbMath0904.05028OpenAlexW2044670343MaRDI QIDQ1127883
Publication date: 10 August 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1831
Related Items (11)
Asymptotic clique covering ratios of distance graphs ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ Invisible runners in finite fields ⋮ Sequences of integers with three missing separations ⋮ On the chromatic number of circulant graphs ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Locating chromatic number of powers of paths and cycles ⋮ Distance graphs with finite chromatic number ⋮ Distance graphs and \(T\)-coloring
Cites Work
This page was built for publication: Pattern periodic coloring of distance graphs