The following pages link to (Q4005786):
Displaying 17 items.
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
- Packing chromatic number of distance graphs (Q412353) (← links)
- A note on 2-distance chromatic numbers of graphs (Q547524) (← links)
- Distance graphs and the \(T\)-coloring problem (Q1297406) (← links)
- Chromatic number of prime distance graphs (Q1329821) (← links)
- On a question concerning prime distance graphs (Q1348134) (← links)
- On the \(d\)-distance face chromatic number of plane graphs (Q1356701) (← links)
- Coloring of integer distance graphs (Q1584411) (← links)
- Distance graphs with finite chromatic number (Q1850605) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- A Chromatic Metric on Graphs (Q3064405) (← links)
- ON DISTANCES IN CHROMATIC GRAPHS (Q3480062) (← links)
- (Q4732484) (← links)
- Distance Graphs from p-adic Norms (Q4933452) (← links)
- Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii (Q5396969) (← 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)
