Asymptotic Clique Covering Ratios of Distance Graphs

Daphne D.-F. Liu, Xuding Zhu

Type: Article

Publication Date: 2002-04-01

Citations: 0

DOI: https://doi.org/10.1006/eujc.2001.0560

View Publication

Locations

European Journal of Combinatorics - View

Similar Works

Action	Title	Year	Authors
+	Packing chromatic number of distance graphs	2011	Jan Ekstein Přemysl Holub Bernard Lidický
+	Packing Chromatic Number of Distance Graphs	2011	Jan Ekstein Přemysl Holub Bernard Lidický
+	Packing Chromatic Number of Distance Graphs	2011	Jan Ekstein Přemysl Holub Bernard Lidický
+ PDF Chat	FROM RAINBOW TO THE LONELY RUNNER: A SURVEY ON COLORING PARAMETERS OF DISTANCE GRAPHS	2008	Daphne Der‐Fen Liu
+ PDF Chat	Maximal Density of Sets with Missing Differences and Various Coloring Parameters of Distance Graphs	2020	Ram Krishna Pandey Neha Rai
+	Distance Graphs with Finite Chromatic Number	2002	Imre Z. Ruzsa Zs. Tuza Margit Voigt
+	Asymptotic behavior of the chromatic index for hypergraphs	1989	Nicholas Pippenger Joel Spencer
+	On a clique covering problem of orlin	1982	David A. Gregory Norman J. Pullman
+	Fractional chromatic number and circular chromatic number for distance graphs with large clique size	2004	Daphne Der‐Fen Liu Xuding Zhu
+	The distance-regular antipodal covers of classical distance-regular graphs	1988	John van Bon A.E. Brouwer
+ PDF Chat	VERTEX COLORING OF CERTAIN DISTANCE GRAPHS	2013	V. Yegnanarayanan A. Parthiban
+	Clique colourings of geometric graphs	2017	Colin McDiarmid Dieter Mitsche Paweł Prałat
+	Clique colourings of geometric graphs	2017	Colin McDiarmid Dieter Mitsche Paweł Prałat
+ PDF Chat	Fractional chromatic number vs. Hall ratio	2024	Raphael Steiner
+ PDF Chat	Packing and Covering a Given Directed Graph in a Directed Graph	2024	Raphael Yuster
+	On packing colorings of distance graphs	2013	Olivier Togni
+ PDF Chat	Clique Colourings of Geometric Graphs	2018	Colin McDiarmid Dieter Mitsche Paweł Prałat
+	On the largest reduced neighborhood clique cover number of a graph	2016	Farhad Shahrokhi
+	On the largest reduced neighborhood clique cover number of a graph	2016	Farhad Shahrokhi
+	Fractional chromatic number and circular chromatic number for distance graphs with large clique size	2004	Daphne Der‐Fen Liu Xuding Zhu

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (17)

Action	Title	Year	Authors
+	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 number of distance graphs with distance sets of cardinality 3	2002	Xuding Zhu
+	Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs	1998	Gerard J. Chang Lingling Huang Xuding Zhu
+	T-colorings of graphs	1992	Daphne Der‐Fen Liu
+	Distance Graphs andT-Coloring	1999	Gerard J. Chang Daphne D.-F. Liu Xuding Zhu
+	Circular chromatic numbers of a class of distance graphs	2003	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
+	Chromatic number of prime distance graphs	1994	Margit Voigt Hans‐Otto Walther