Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dürer_graph> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Dürer_graph abstract "In the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose 1514 engraving Melencolia I includes a depiction of Dürer's solid, a convex polyhedron having the Dürer graph as its skeleton. Dürer's solid is one of only four well-covered simple convex polyhedra.".
- Dürer_graph thumbnail Dürer_Melancholia_I.jpg?width=300.
- Dürer_graph wikiPageID "23453065".
- Dürer_graph wikiPageRevisionID "581008099".
- Dürer_graph automorphisms "12".
- Dürer_graph chromaticIndex "3".
- Dürer_graph chromaticNumber "3".
- Dürer_graph diameter "4".
- Dürer_graph edges "18".
- Dürer_graph girth "3".
- Dürer_graph imageCaption "The Dürer graph".
- Dürer_graph name "Dürer graph".
- Dürer_graph namesake Albrecht_Dürer.
- Dürer_graph properties Cubic_graph.
- Dürer_graph properties Planar_graph.
- Dürer_graph properties Well-covered_graph.
- Dürer_graph vertices "12".
- Dürer_graph subject Category:Individual_graphs.
- Dürer_graph subject Category:Planar_graphs.
- Dürer_graph subject Category:Polyhedra.
- Dürer_graph subject Category:Regular_graphs.
- Dürer_graph comment "In the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose 1514 engraving Melencolia I includes a depiction of Dürer's solid, a convex polyhedron having the Dürer graph as its skeleton. Dürer's solid is one of only four well-covered simple convex polyhedra.".
- Dürer_graph label "Dürer graph".
- Dürer_graph label "Graphe de Dürer".
- Dürer_graph sameAs D%C3%BCrer_graph.
- Dürer_graph sameAs Graphe_de_Dürer.
- Dürer_graph sameAs Q3115478.
- Dürer_graph sameAs Q3115478.
- Dürer_graph wasDerivedFrom Dürer_graph?oldid=581008099.
- Dürer_graph depiction Dürer_Melancholia_I.jpg.
