Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
From MaRDI portal
Publication:2946061
DOI10.1007/978-3-319-19315-1_22zbMath1401.11117OpenAlexW2295791742MaRDI QIDQ2946061
Daphne Der-Fen Liu, Daniel Collister
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_22
Related Items (4)
Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) ⋮ Density of sets with missing differences and applications ⋮ Maximal density of integral sets with missing differences and the kappa values
Cites Work
- Colouring the real line
- Colouring prime distance graphs
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- The lonely runner with seven runners
- View-obstruction problems. III
- On the chromatic number of special distance graphs
- Chromatic number of prime distance graphs
- Flows, view obstructions, and the lonely runner
- Sequences of integers with missing differences
- Coloring of integer distance graphs
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- View-obstruction problems in \(n\)-dimensional geometry
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- An Asymptotic Approach to the Channel Assignment Problem
- Sets of integers with missing differences
- Sets of integers with missing differences
- Circular chromatic number: A survey
- Six lonely runners
This page was built for publication: Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
