Fractional chromatic number and circular chromatic number for distance graphs with large clique size
From MaRDI portal
Publication:3159396
DOI10.1002/JGT.20020zbMATH Open1055.05059OpenAlexW4246846606MaRDI QIDQ3159396FDOQ3159396
Authors: Daphne Der-Fen Liu, Xuding Zhu 
Publication date: 16 February 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20020
Recommendations
- Distance graphs and \(T\)-coloring
- Circular chromatic numbers and fractional chromatic numbers of distance graphs with distance sets missing an interval.
- Circular chromatic numbers and fractional chromatic numbers of distance graphs
- Coloring of distance graphs with intervals as distance sets
- scientific article; zbMATH DE number 1275588
densityindependence number\(T\)-coloringdistance graphscircular chromatic numberfractional chromatic numberinteger sequences
Cited In (20)
- On optimal \(M\)-sets related to Motzkin's problem
- Solution to a conjecture of Schmidt and Tuller on one-dimensional packings and coverings
- Asymptotic clique covering ratios of distance graphs
- Fractional chromatic number of distance graphs generated by two-interval sets
- Barely lonely runners and very lonely runners: a refined approach to the Lonely Runner Problem
- 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 the independence ratio of distance graphs
- Fractional DP-chromatic number of planar graphs of large girth
- Distance Graphs Generated by Five Primes (Research)
- On the chromatic number of circulant graphs
- Distance graphs with maximum chromatic number
- On the density of integral sets with missing differences from sets related to arithmetic progressions
- Max-norm Ramsey theory
- Density of sets with missing differences and applications
- Sequences of integers with three missing separations
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\)
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$
- Maximal density of integral sets with missing differences and the kappa values
- Maximal density of sets with missing differences and various coloring parameters of distance graphs
- Title not available (Why is that?)
This page was built for publication: Fractional chromatic number and circular chromatic number for distance graphs with large clique size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159396)
