Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Goldner–Harary_graph> ?p ?o }
Showing triples 1 to 91 of
91
with 100 triples per page.
- Goldner–Harary_graph abstract "In the mathematical field of graph theory, the Goldner–Harary graph is a simple undirected graph with 11 vertices and 27 edges. It is named after A. Goldner and Frank Harary, who proved in 1975 that it was the smallest non-Hamiltonian maximal planar graph. The same graph had already been given as an example of a non-Hamiltonian simplicial polyhedron by Branko Grünbaum in 1967.".
- Goldner–Harary_graph thumbnail Goldner-Harary_graph.svg?width=300.
- Goldner–Harary_graph wikiPageID "24674758".
- Goldner–Harary_graph wikiPageLength "5654".
- Goldner–Harary_graph wikiPageOutDegree "48".
- Goldner–Harary_graph wikiPageRevisionID "569349796".
- Goldner–Harary_graph wikiPageWikiLink Apollonian_network.
- Goldner–Harary_graph wikiPageWikiLink Book_embedding.
- Goldner–Harary_graph wikiPageWikiLink Book_thickness.
- Goldner–Harary_graph wikiPageWikiLink Branko_Grünbaum.
- Goldner–Harary_graph wikiPageWikiLink Category:4-chromatic_graphs.
- Goldner–Harary_graph wikiPageWikiLink Category:Individual_graphs.
- Goldner–Harary_graph wikiPageWikiLink Category:Planar_graphs.
- Goldner–Harary_graph wikiPageWikiLink Characteristic_polynomial.
- Goldner–Harary_graph wikiPageWikiLink Chordal_graph.
- Goldner–Harary_graph wikiPageWikiLink Chromatic_index.
- Goldner–Harary_graph wikiPageWikiLink Chromatic_number.
- Goldner–Harary_graph wikiPageWikiLink Dihedral_group.
- Goldner–Harary_graph wikiPageWikiLink Dual_graph.
- Goldner–Harary_graph wikiPageWikiLink Edge_coloring.
- Goldner–Harary_graph wikiPageWikiLink Frank_Harary.
- Goldner–Harary_graph wikiPageWikiLink Glossary_of_graph_theory.
- Goldner–Harary_graph wikiPageWikiLink Graph_(mathematics).
- Goldner–Harary_graph wikiPageWikiLink Graph_automorphism.
- Goldner–Harary_graph wikiPageWikiLink Graph_coloring.
- Goldner–Harary_graph wikiPageWikiLink Graph_theory.
- Goldner–Harary_graph wikiPageWikiLink Hamiltonian_graph.
- Goldner–Harary_graph wikiPageWikiLink Hamiltonian_path.
- Goldner–Harary_graph wikiPageWikiLink Herschel_graph.
- Goldner–Harary_graph wikiPageWikiLink Hexagon.
- Goldner–Harary_graph wikiPageWikiLink K-edge-connected_graph.
- Goldner–Harary_graph wikiPageWikiLink K-tree.
- Goldner–Harary_graph wikiPageWikiLink K-vertex-connected_graph.
- Goldner–Harary_graph wikiPageWikiLink Kleetope.
- Goldner–Harary_graph wikiPageWikiLink Mathematics.
- Goldner–Harary_graph wikiPageWikiLink Maximal_planar_graph.
- Goldner–Harary_graph wikiPageWikiLink N-skeleton.
- Goldner–Harary_graph wikiPageWikiLink Octahedron.
- Goldner–Harary_graph wikiPageWikiLink Perfect_graph.
- Goldner–Harary_graph wikiPageWikiLink Planar_graph.
- Goldner–Harary_graph wikiPageWikiLink Polyhedral_graph.
- Goldner–Harary_graph wikiPageWikiLink Regular_hexagon.
- Goldner–Harary_graph wikiPageWikiLink Simplicial_polyhedron.
- Goldner–Harary_graph wikiPageWikiLink Simplicial_polytope.
- Goldner–Harary_graph wikiPageWikiLink Skeleton_(topology).
- Goldner–Harary_graph wikiPageWikiLink Steinitzs_theorem.
- Goldner–Harary_graph wikiPageWikiLink Treewidth.
- Goldner–Harary_graph wikiPageWikiLink Triakis_octahedron.
- Goldner–Harary_graph wikiPageWikiLink Triangular_bipyramid.
- Goldner–Harary_graph wikiPageWikiLink Triangular_dipyramid.
- Goldner–Harary_graph wikiPageWikiLink Triangular_prism.
- Goldner–Harary_graph wikiPageWikiLink Truncation_(geometry).
- Goldner–Harary_graph wikiPageWikiLink Undirected_graph.
- Goldner–Harary_graph wikiPageWikiLink Vertex_connectivity.
- Goldner–Harary_graph wikiPageWikiLink File:Goldner-Harary_graph.svg.
- Goldner–Harary_graph wikiPageWikiLinkText "Goldner–Harary graph".
- Goldner–Harary_graph automorphisms "12".
- Goldner–Harary_graph chromaticIndex "8".
- Goldner–Harary_graph chromaticNumber "4".
- Goldner–Harary_graph diameter "2".
- Goldner–Harary_graph edges "27".
- Goldner–Harary_graph girth "3".
- Goldner–Harary_graph hasPhotoCollection Goldner–Harary_graph.
- Goldner–Harary_graph name "Goldner–Harary graph".
- Goldner–Harary_graph namesake Frank_Harary.
- Goldner–Harary_graph namesake "A. Goldner,".
- Goldner–Harary_graph properties Chordal_graph.
- Goldner–Harary_graph properties Perfect_graph.
- Goldner–Harary_graph properties Planar_graph.
- Goldner–Harary_graph properties Polyhedral_graph.
- Goldner–Harary_graph properties "Treewidth 3".
- Goldner–Harary_graph radius "2".
- Goldner–Harary_graph title "Goldner-Harary graph".
- Goldner–Harary_graph urlname "Goldner-HararyGraph".
- Goldner–Harary_graph vertices "11".
- Goldner–Harary_graph wikiPageUsesTemplate Template:Infobox_graph.
- Goldner–Harary_graph wikiPageUsesTemplate Template:Mathworld.
- Goldner–Harary_graph wikiPageUsesTemplate Template:Reflist.
- Goldner–Harary_graph subject Category:4-chromatic_graphs.
- Goldner–Harary_graph subject Category:Individual_graphs.
- Goldner–Harary_graph subject Category:Planar_graphs.
- Goldner–Harary_graph comment "In the mathematical field of graph theory, the Goldner–Harary graph is a simple undirected graph with 11 vertices and 27 edges. It is named after A. Goldner and Frank Harary, who proved in 1975 that it was the smallest non-Hamiltonian maximal planar graph. The same graph had already been given as an example of a non-Hamiltonian simplicial polyhedron by Branko Grünbaum in 1967.".
- Goldner–Harary_graph label "Goldner–Harary graph".
- Goldner–Harary_graph sameAs Graphe_de_Goldner-Harary.
- Goldner–Harary_graph sameAs m.080ctqb.
- Goldner–Harary_graph sameAs Граф_Голднера–Харари.
- Goldner–Harary_graph sameAs Q3115488.
- Goldner–Harary_graph sameAs Q3115488.
- Goldner–Harary_graph wasDerivedFrom Goldner–Harary_graph?oldid=569349796.
- Goldner–Harary_graph depiction Goldner-Harary_graph.svg.
- Goldner–Harary_graph isPrimaryTopicOf Goldner–Harary_graph.