Chromatic number of distance graphs generated by the sets {2,3,x,y}-Reference-Cited by-同舟云学术

Chromatic number of distance graphs generated by the sets {2,3,x,y}

Published:2012-05-30 Issue:4 Volume:25 Page:680-693
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Liu Daphne Der-Fen,Sutedja Aileen

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-012-9509-4.pdf

Reference36 articles.

1. Barajas J, Serra O (2008a) Distance graphs with maximum chromatic number. Discrete Math 308:1355–1365

2. Barajas J, Serra O (2008b) The lonely runner with seven runners. Electron J Comb 15:#R48

3. Betke U, Wills JM (1972) Untere Schranken für zwei diophantische approximations-Funktionen. Monatsch Math 76:214–217

4. Bienia W, Goddyn L, Gvozdjak P, Sebő A, Tarsi M (1998) Flows, view obstructions, and the lonely runner. J Comb Theory, Ser B 72:1–9

5. Bohman T, Holzman R, Kleitman D (2001) Six lonely runners. Electron J Comb 8 (Research Paper 3, 49 pp)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On S-packing colourings of distance graphs D(1,t) and D(1,2,t);Applied Mathematics and Computation;2023-06

2. Maximal Density and the Kappa Values for the Families {a, a + 1, 2a + 1, n} and {a, a + 1, 2a + 1, 3a + 1, n};Mathematica Slovaca;2023-06-01

3. Density of sets with missing differences and applications;Mathematica Slovaca;2021-06-01

4. Maximal Density of Sets with Missing Differences and Various Coloring Parameters of Distance Graphs;Taiwanese Journal of Mathematics;2020-12-01

5. On the independence ratio of distance graphs;Discrete Mathematics;2016-12