Pattern periodic coloring of distance graphs
From MaRDI portal
Publication:1127883
DOI10.1006/JCTB.1998.1831zbMATH Open0904.05028OpenAlexW2044670343MaRDI QIDQ1127883FDOQ1127883
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
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
- Unsolved problems in geometry
- On the chromatic number of special distance graphs
- The chromatic numbers of distance graphs
- Colouring the real line
- Integral distance graphs
- Chromatic number of prime distance graphs
- Title not available (Why is that?)
- Colouring prime distance graphs
- Colouring of distance graphs
- On Landau's function g(n)
Cited In (12)
- 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
- Distance Graphs Generated by Five Primes (Research)
- Chromatic coloring of distance graphs \(\mathrm{V}\)
- On the chromatic number of circulant graphs
- 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)
