Fractional chromatic number and circular chromatic number for distance graphs with large clique size

Daphne Der‐Fen Liu, Xuding Zhu

Type: Article

Publication Date: 2004-07-01

Citations: 21

DOI: https://doi.org/10.1002/jgt.20020

View Publication

Locations

Journal of Graph Theory - View

Similar Works

Action	Title	Year	Authors
+	Fractional chromatic number and circular chromatic number for distance graphs with large clique size	2004	Daphne Der‐Fen Liu Xuding Zhu
+	Circular chromatic number of distance graphs with distance sets of cardinality 3	2002	Xuding Zhu
+	Circular chromatic number of distance graphs with distance sets of cardinality 3	2002	Xuding Zhu
+ PDF Chat	D. Liu and X. Zhu, Erratum to: “Fractional chromatic number and circular chromatic number for distance graphs with large clique size”. <i>Journal of Graph Theory</i><b>47</b>(2) 2004, 129–146	2005	Daphne Der‐Fen Liu Xuding Zhu
+	Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval.	2004	Jianzhuan Wu Wensong Lin
+	Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs	1998	Gerard J. Chang Lingling Huang Xuding Zhu
+	Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples	2000	Lingling Huang Gerard J. Chang
+	Circular Chromatic Number of Hypergraphs.	2004	Changiz Eslahchi Arash Rafiey
+	Distance graphs with large chromatic number and without large cliques	2010	А. М. Райгородский Oleg Rubanov
+ PDF Chat	Circular chromatic index of graphs of maximum degree 3	2005	Peyman Afshani Ghandehari Mahsa Mahya Ghandehari Hamed Hatami Ruzbeh Tusserkani Xuding Zhu
+	Coloring of distance graphs with intervals as distance sets	2004	Peter Che Bor Lam Wensong Lin
+	Circular chromatic numbers of a class of distance graphs	2003	Xuding Zhu
+	Distance graphs with large chromatic numbers and small clique numbers	2012	Andrey Kupavskii А. М. Райгородский
+	Chromatic number and fractional chromatic number of two classes of distance graphs	2001	Wu Jian
+	GRAPHS WHOSE CIRCULAR CLIQUE NUMBER EQUAL THE CLIQUE NUMBER	2005	Zhou Xinghe
+	Triangle-free subgraphs with large fractional chromatic number	2018	Bojan Mohar Hehui Wu
+ PDF Chat	On the circular chromatic number of circular partitionable graphs	2006	Arnaud Pêcher Xuding Zhu
+	Circular chromatic numbers of some distance graphs	2005	Wensong Lin Peter Che Bor Lam Zengmin Song
+ PDF Chat	Triangle-free subgraphs with large fractional chromatic number	2021	Bojan Mohar Hehui Wu
+	Distance Graphs with Large Chromatic Number and without Cliques of Given Size in the Rational Space	2019	Yu. A. Demidovich

Works That Cite This (19)

Action	Title	Year	Authors
+ PDF Chat	On Optimal M-Sets Related to Motzkin’s Problem	2020	Quan-Hui Yang T. K. Pan Jian-Dong Wu
+ PDF Chat	FROM RAINBOW TO THE LONELY RUNNER: A SURVEY ON COLORING PARAMETERS OF DISTANCE GRAPHS	2008	Daphne Der‐Fen Liu
+ PDF Chat	D. Liu and X. Zhu, Erratum to: “Fractional chromatic number and circular chromatic number for distance graphs with large clique size”. <i>Journal of Graph Theory</i><b>47</b>(2) 2004, 129–146	2005	Daphne Der‐Fen Liu Xuding Zhu
+ PDF Chat	Max-norm Ramsey theory	2024	Nóra Frankl Andrey Kupavskii Арсений Сагдеев
+ PDF Chat	Distance graphs with maximum chromatic number	2007	Javier Barajas Oriol Serra
+	On the density of integral sets with missing differences from sets related to arithmetic progressions	2011	Ram Krishna Pandey Amitabha Tripathi
+	Sequences of integers with three missing separations	2019	Daphne Der‐Fen Liu Grant Robinson
+ PDF Chat	Maximal Density and the Kappa Values for the Families {<i>a</i>, <i>a</i> + 1, 2<i>a</i> + 1, <i>n</i>} and {<i>a</i>, <i>a</i> + 1, 2<i>a</i> + 1, 3<i>a</i> + 1, <i>n</i>}	2023	Ram Krishna Pandey Neha Rai
+	On the independence ratio of distance graphs	2016	James M. Carraher David Galvin Stephen G. Hartke A. J. Radcliffe Derrick Stolee
+ PDF Chat	Maximal Density of Integral Sets with Missing Differences and the Kappa Values	2021	Ram Krishna Pandey Anshika Srivastava

Works Cited by This (17)

Action	Title	Year	Authors
+	Flows, View Obstructions, and the Lonely Runner	1998	Wojciech Bienia Luis Goddyn Pavol Gvozdjak András Sebö Michael Tarsi
+	An Asymptotic Approach to the Channel Assignment Problem	1985	Joshua H. Rabinowitz Viera K. Proulx
+	Sets of integers with missing differences	1977	Nicolas M Haralambis
+	Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs	1998	Gerard J. Chang Lingling Huang Xuding Zhu
+	Distance Graphs andT-Coloring	1999	Gerard J. Chang Daphne D.-F. Liu Xuding Zhu
+	Sequences of integers with missing differences	1973	David G. Cantor Basil Gordon
+	The channel assignment problem for mutually adjacent sites	1994	Jerrold R. Griggs Daphne Der‐Fen Liu
+	On a conjecture in diophantine approximations, II	1991	Yong-Gao Chen
+	Combinatorial Geometry in the Plane.	1965	G. P. Johnson H. Hadwiger Hans Debrunner Victor Klee
+	Chromatic number of prime distance graphs	1994	Margit Voigt Hans‐Otto Walther