Matches in DBpedia 2014 for { ?s ?p In mathematics, and particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points by an edge whenever the distance between the two points is exactly one. Edges of unit distance graphs sometimes cross each other, so they are not always planar; a unit distance graph without crossings is called a matchstick graph.The Hadwiger–Nelson problem concerns the chromatic number of unit distance graphs.. }
Showing items 1 to 1 of
1
with 100 items per page.
- Unit_distance_graph comment "In mathematics, and particularly geometric graph theory, a unit distance graph is a graph formed from a collection of points in the Euclidean plane by connecting two points by an edge whenever the distance between the two points is exactly one. Edges of unit distance graphs sometimes cross each other, so they are not always planar; a unit distance graph without crossings is called a matchstick graph.The Hadwiger–Nelson problem concerns the chromatic number of unit distance graphs.".