Pages that link to "Item:Q3918134"
From MaRDI portal
The following pages link to On the chromatic number of geometric graphs (Q3918134):
Displaying 15 items.
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058) (← links)
- Graphs associated with vector spaces of even dimension: A link with differential geometry (Q417560) (← links)
- A dimension 6 graph with minimum edge-set (Q1696543) (← links)
- Orthogonal representations and connectivity of graphs (Q1823259) (← links)
- Geometrical embeddings of graphs (Q1825202) (← links)
- Embedding Euclidean distance graphs in \(\mathbb{R}^n\) and \(\mathbb{Q}^n\) (Q2172834) (← links)
- On the chromatic number of some geometric type Kneser graphs (Q2387203) (← links)
- Two notions of unit distance graphs (Q2451892) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Self-dual polytopes and the chromatic number of distance graphs on the sphere (Q3315532) (← links)
- (Q4623033) (← links)
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs (Q5693810) (← links)
- Embedding graphs in Euclidean space (Q5915814) (← links)
- Embedding graphs in Euclidean space (Q5919437) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)
