Pattern periodic coloring of distance graphs
From MaRDI portal
(Redirected from Publication:1127883)
Recommendations
- Colorings of distance graphs
- Open distance pattern coloring of a graph
- Colouring of distance graphs
- Coloring the distance graphs
- The distance coloring of graphs
- Periodic assignment and graph colouring
- Coloring distance graphs and graphs of diameters
- Coloring of integer distance graphs
- scientific article; zbMATH DE number 5026903
- Coloring of n-dimensional distance graphs
Cites work
- scientific article; zbMATH DE number 4099328 (Why is no real title available?)
- Chromatic number of prime distance graphs
- Colouring of distance graphs
- Colouring prime distance graphs
- Colouring the real line
- Integral distance graphs
- On Landau's function g(n)
- On the chromatic number of special distance graphs
- The chromatic numbers of distance graphs
- Unsolved problems in geometry
Cited in
(13)- Coloring of distance graphs with intervals as distance sets
- Locating chromatic number of powers of paths and cycles
- Asymptotic clique covering ratios of distance graphs
- Invisible runners in finite fields
- Distance graphs with finite chromatic number
- Open distance pattern coloring of a graph
- Distance Graphs Generated by Five Primes (Research)
- On the chromatic number of circulant graphs
- Chromatic coloring of distance graphs \(\mathrm{V}\)
- Sequences of integers with three missing separations
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- Biclique-colouring verification complexity and biclique-colouring power graphs
- Distance graphs and \(T\)-coloring
This page was built for publication: Pattern periodic coloring of distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127883)
