Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
From MaRDI portal
Publication:1956238
DOI10.1007/s10878-012-9509-4zbMath1273.90230OpenAlexW1982052215MaRDI QIDQ1956238
Aileen Sutedja, Daphne Der-Fen Liu
Publication date: 13 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9509-4
chromatic numberlonely runner conjecturedistance graphsdensity of sequences with missing differences
Related Items (6)
Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) ⋮ On \(S\)-packing colourings of distance graphs \(D (1, t)\) and \(D (1, 2, t)\) ⋮ On the independence ratio of distance graphs ⋮ Density of sets with missing differences and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colouring the real line
- Colouring prime distance graphs
- Fractional chromatic number of distance graphs generated by two-interval sets
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
- The lonely runner with seven runners
- View-obstruction problems. III
- Pattern periodic coloring of distance graphs
- On the chromatic number of special distance graphs
- Circular chromatic numbers and fractional chromatic numbers of 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
- Circular chromatic numbers of a class of distance graphs
- View-obstruction problems in \(n\)-dimensional geometry
- Distance graphs with maximum chromatic number
- Zwei Sätze über inhomogene diophantische Approximation von Irrationalzahlen
- Untere Schranken für zwei diophantische Approximations-Funktionen
- Coloring of distance graphs with intervals as distance sets
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- Integral distance graphs
- Circular chromatic number of distance graphs with distance sets of cardinality 3
- Sets of integers with missing differences
- Circular chromatic number: A survey
- Chromatic numbers of integer distance graphs
- Six lonely runners
This page was built for publication: Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
