Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Unit_distance_graph> ?p ?o. }
Showing items 1 to 46 of
46
with 100 items per page.
- Unit_distance_graph abstract "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. It is known that there exist unit distance graphs requiring four colors in any proper coloring, and that all such graphs can be colored with at most seven colors. Another important open problem concerning unit distance graphs asks how many edges they can have relative to their number of vertices.".
- Unit_distance_graph thumbnail Petersen_graph,_unit_distance.svg?width=300.
- Unit_distance_graph wikiPageExternalLink P39.html.
- Unit_distance_graph wikiPageExternalLink 01109.pdf.
- Unit_distance_graph wikiPageExternalLink prizes.erd.
- Unit_distance_graph wikiPageID "7158665".
- Unit_distance_graph wikiPageRevisionID "603815833".
- Unit_distance_graph author1Link "Joel Spencer".
- Unit_distance_graph author2Link "Endre Szemerédi".
- Unit_distance_graph authorlink "Paul Erdős".
- Unit_distance_graph first "Endre".
- Unit_distance_graph first "Joel".
- Unit_distance_graph first "Paul".
- Unit_distance_graph first "William".
- Unit_distance_graph hasPhotoCollection Unit_distance_graph.
- Unit_distance_graph last "Erdős".
- Unit_distance_graph last "Maehara".
- Unit_distance_graph last "Spencer".
- Unit_distance_graph last "Szemerédi".
- Unit_distance_graph last "Trotter".
- Unit_distance_graph title "Unit-Distance Graph".
- Unit_distance_graph urlname "Unit-DistanceGraph".
- Unit_distance_graph year "1946".
- Unit_distance_graph year "1984".
- Unit_distance_graph year "1991".
- Unit_distance_graph year "1992".
- Unit_distance_graph subject Category:Geometric_graphs.
- Unit_distance_graph type Abstraction100002137.
- Unit_distance_graph type Communication100033020.
- Unit_distance_graph type GeometricGraphs.
- Unit_distance_graph type Graph107000195.
- Unit_distance_graph type VisualCommunication106873252.
- 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.".
- Unit_distance_graph label "Einheitsdistanz-Graph".
- Unit_distance_graph label "Graphe distance-unité".
- Unit_distance_graph label "Unit distance graph".
- Unit_distance_graph label "Граф единичных расстояний".
- Unit_distance_graph sameAs Einheitsdistanz-Graph.
- Unit_distance_graph sameAs Graphe_distance-unité.
- Unit_distance_graph sameAs m.0h79tw.
- Unit_distance_graph sameAs Q745378.
- Unit_distance_graph sameAs Q745378.
- Unit_distance_graph sameAs Unit_distance_graph.
- Unit_distance_graph wasDerivedFrom Unit_distance_graph?oldid=603815833.
- Unit_distance_graph depiction Petersen_graph,_unit_distance.svg.
- Unit_distance_graph isPrimaryTopicOf Unit_distance_graph.