Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Sign In
Light
Dark
System
Javier Barajas
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
On the chromatic number of circulant graphs
2008
Javier Barajas
Oriol Serra
+
PDF
Chat
Distance graphs with maximum chromatic number
2007
Javier Barajas
Oriol Serra
+
The lonely runner with seven runners
2007
Javier Barajas
Oriol Serra
+
PDF
Chat
Distance graphs with maximum chromatic number
2005
Javier Barajas
Oriol Serra
Common Coauthors
Coauthor
Papers Together
Oriol Serra
4
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
Circular chromatic number of distance graphs with distance sets of cardinality 3
2002
Xuding Zhu
3
+
On planarity and colorability of circulant graphs
2003
Clemens Heuberger
3
+
PDF
Chat
Coloring the distance graphs
2023
Jindřich Zapletal
3
+
PDF
Chat
View-obstruction: a shorter proof for 6 lonely runners
2004
Jérôme Renault
2
+
Distance Graphs with Finite Chromatic Number
2002
Imre Z. Ruzsa
Zs. Tuza
Margit Voigt
2
+
PDF
Chat
Six Lonely Runners
2001
Tom Bohman
Ron Holzman
Dan Kleitman
2
+
Flows, View Obstructions, and the Lonely Runner
1998
Wojciech Bienia
Luis Goddyn
Pavol Gvozdjak
András Sebö
Michael Tarsi
2
+
Fractional chromatic number and circular chromatic number for distance graphs with large clique size
2004
Daphne Der‐Fen Liu
Xuding Zhu
2
+
Fractional chromatic number and circular chromatic number for distance graphs with large clique size
2004
Daphne Der‐Fen Liu
Xuding Zhu
2
+
Circular chromatic number of distance graphs with distance sets of cardinality 3
2002
Xuding Zhu
2
+
Chromatic numbers of integer distance graphs
2001
Arnfried Kemnitz
Massimiliano Marangio
2
+
View-obstruction problems. II
1982
Thomas W. Cusick
2
+
4-Colorable 6-regular toroidal graphs
2003
Hong-Gwa Yeh
Xuding Zhu
2
+
View-obstruction problems in n-dimensional geometry
1974
Thomas W. Cusick
2
+
Integral distance graphs
1997
Jer-Jeong Chen
Gerard J. Chang
Kuo‐Ching Huang
2
+
Colouring the real line
1985
Roger B. Eggleton
Paul Erdős
Donald K. Skilton
2
+
Untere Schranken f�r zwei diophantische Approximations-Funktionen
1972
U. Betke
J. M. Wills
1
+
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
1998
Gerard J. Chang
Lingling Huang
Xuding Zhu
1
+
Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs
1985
László Babai
Vera T. Sós
1
+
Circular chromatic numbers of some distance graphs
2005
Wensong Lin
Peter Che Bor Lam
Zengmin Song
1
+
Distance graphs with missing multiples in the distance sets
1999
Daphne D.-F. Liu
Xuding Zhu
1
+
Minimum chromaticity of circulant graphs
2005
Nenad Obradoviç
Joseph G. Peters
Goran Ružić
1
+
Chromatic Numbers of Cayley Graphs on Z and Recurrence
2001
Yitzhak Katznelson
1
+
PDF
Chat
Distance graphs with maximum chromatic number
2007
Javier Barajas
Oriol Serra
1
+
Zwei S�tze �ber inhomogene diophantische Approximation von Irrationalzehlen
1967
J�rg M. Wills
1
+
Distance Graphs on the Integers
2005
Mike Ferrara
Yoshiharu Kohayakawa
V. Rödl
1
+
On a conjecture in Diophantine approximations III
1991
Yong-Gao Chen
1
+
On a Conjecture in Diophantine Approximations, IV
1993
Y.G. Chen
1
+
Integral distance graphs
1997
Jer‐Jeong Chen
Gerard J. Chang
Kuo‐Ching Huang
1