Pages that link to "Item:Q1266350"
From MaRDI portal
The following pages link to Circular chromatic numbers and fractional chromatic numbers of distance graphs (Q1266350):
Displaying 23 items.
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- On Hamiltonian paths in distance graphs (Q533446) (← links)
- On the density of integral sets with missing differences from sets related to arithmetic progressions (Q627623) (← links)
- Long cycles and paths in distance graphs (Q712275) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- On the chromatic number of circulant graphs (Q1045059) (← links)
- Circular chromatic numbers of Mycielski's graphs (Q1301826) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306) (← links)
- Some star extremal circulant graphs (Q1408873) (← links)
- 4-colorable 6-regular toroidal graphs. (Q1417583) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Circular chromatic numbers of some distance graphs (Q1773363) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- Circular chromatic numbers of distance graphs with distance sets missing multiples (Q1971805) (← links)
- On optimal \(M\)-sets related to Motzkin's problem (Q1983376) (← links)
- The packing coloring of distance graphs \(D(k,t)\) (Q2440104) (← links)
- Coloring of distance graphs with intervals as distance sets (Q2567207) (← links)
- Connectivity and diameter in distance graphs (Q3087615) (← links)
- The b-chromatic number of power graphs of complete caterpillars (Q3379157) (← links)
- The circular chromatic number of the Mycielskian ofGdk (Q4265588) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
