Coloring of integer distance graphs
From MaRDI portal
Publication:1584411
DOI10.1016/S0012-365X(98)00099-5zbMATH Open0956.05044MaRDI QIDQ1584411FDOQ1584411
Authors: Arnfried Kemnitz, Halka Kolberg 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- 25 pretty graph colouring problems
- On the chromatic number of special distance graphs
- Title not available (Why is that?)
- Colouring the real line
- Chromatic number of prime distance graphs
- Colouring prime distance graphs
- Title not available (Why is that?)
- A LINEAR DIOPHANTINE EQUATION WITH APPLICATIONS TO NON‐NEGATIVE MATRICES
Cited In (46)
- Chromatic number of graphs with special distance sets. I
- The vertex linear arboricity of distance graphs
- Edge colorings and total colorings of integer distance graphs
- Coloring of distance graphs with intervals as distance sets
- Powers of cycles, powers of paths, and distance graphs
- Circular chromatic numbers of some distance graphs
- Colouring prime distance graphs
- Minimum chromaticity of circulant graphs
- Title not available (Why is that?)
- Asymptotic clique covering ratios of distance graphs
- On a question concerning prime distance graphs
- Fractional chromatic number of distance graphs generated by two-interval sets
- Distance graphs with finite chromatic number
- On the independence ratio of distance graphs
- Coloring the real line with monochromatic intervals
- Title not available (Why is that?)
- Translating Integer Factoring into Graph Coloring
- Distance Graphs Generated by Five Primes (Research)
- Chromatic coloring of distance graphs \(\mathrm{V}\)
- Title not available (Why is that?)
- The vertex linear arboricity of the integer distance graph \(G(D_{m,k,2})\)
- Circular chromatic numbers of distance graphs with distance sets missing multiples
- Vertex arboricity of integer distance graph \(G(D_{m,k})\)
- Colouring of distance graphs
- Connectedness of finite distance graphs
- Structural properties of Toeplitz graphs
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- Connectivity and diameter in distance graphs
- Integral distance graphs
- Sequences of integers with three missing separations
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- Title not available (Why is that?)
- On the chromatic number of special distance graphs
- Distance graphs and \(T\)-coloring
- Coloring integral distance graphs with finite distance sets
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern periodic coloring of distance graphs
- Distance graph Ramsey sets
- Maximal density of sets with missing differences and various coloring parameters of distance graphs
- Chromatic numbers of integer distance graphs
- The packing coloring of distance graphs \(D(k,t)\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 2-distance colorings of integer distance graphs
This page was built for publication: Coloring of integer distance graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584411)
