Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2061755> ?p ?o }
Showing triples 1 to 33 of
33
with 100 triples per page.
- Q2061755 subject Q7007191.
- Q2061755 subject Q8546843.
- Q2061755 subject Q8647012.
- Q2061755 abstract "In the mathematical field of graph theory, the Frucht graph is a 3-regular graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1939.The Frucht graph is a Halin graph with chromatic number 3, chromatic index 3, radius 3, diameter 4 and girth 3. As with every Halin graph, the Frucht graph is planar, 3-vertex-connected, and polyhedral. It is also a 3-edge-connected graph. Its independence number is 5.The Frucht graph is Hamiltonian and can be constructed from the LCF notation: [−5,−2,−4,2,5,−2,2,5,−2,−5,4,2].".
- Q2061755 thumbnail Frucht_planar_Lombardi.svg?width=300.
- Q2061755 wikiPageWikiLink Q1050972.
- Q2061755 wikiPageWikiLink Q131476.
- Q2061755 wikiPageWikiLink Q1374495.
- Q2061755 wikiPageWikiLink Q1424481.
- Q2061755 wikiPageWikiLink Q166507.
- Q2061755 wikiPageWikiLink Q1797915.
- Q2061755 wikiPageWikiLink Q273037.
- Q2061755 wikiPageWikiLink Q2913731.
- Q2061755 wikiPageWikiLink Q3034655.
- Q2061755 wikiPageWikiLink Q3034855.
- Q2061755 wikiPageWikiLink Q3115621.
- Q2061755 wikiPageWikiLink Q395.
- Q2061755 wikiPageWikiLink Q4555371.
- Q2061755 wikiPageWikiLink Q504843.
- Q2061755 wikiPageWikiLink Q522384.
- Q2061755 wikiPageWikiLink Q547823.
- Q2061755 wikiPageWikiLink Q568687.
- Q2061755 wikiPageWikiLink Q7007191.
- Q2061755 wikiPageWikiLink Q826467.
- Q2061755 wikiPageWikiLink Q83478.
- Q2061755 wikiPageWikiLink Q834981.
- Q2061755 wikiPageWikiLink Q849705.
- Q2061755 wikiPageWikiLink Q8546843.
- Q2061755 wikiPageWikiLink Q8647012.
- Q2061755 wikiPageWikiLink Q959831.
- Q2061755 comment "In the mathematical field of graph theory, the Frucht graph is a 3-regular graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1939.The Frucht graph is a Halin graph with chromatic number 3, chromatic index 3, radius 3, diameter 4 and girth 3. As with every Halin graph, the Frucht graph is planar, 3-vertex-connected, and polyhedral. It is also a 3-edge-connected graph.".
- Q2061755 label "Frucht graph".
- Q2061755 depiction Frucht_planar_Lombardi.svg.