Pages that link to "Item:Q1709876"
From MaRDI portal
The following pages link to On the chromatic numbers of some distance graphs (Q1709876):
Displaying 15 items.
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
- A note on 2-distance chromatic numbers of graphs (Q547524) (← links)
- On the \(d\)-distance face chromatic number of plane graphs (Q1356701) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- On the independence number and the chromatic number of generalized preferential attachment models (Q2197436) (← links)
- On the chromatic number of random subgraphs of a certain distance graph (Q2322889) (← links)
- ON DISTANCES IN CHROMATIC GRAPHS (Q3480062) (← links)
- (Q4005786) (← links)
- (Q4732484) (← links)
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969) (← links)
- On d-distance equitable chromatic number of some graphs (Q5865976) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)
- Chromatic coloring of distance graphs, III (Q6113545) (← links)
