Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Errera_graph> ?p ?o }
Showing triples 1 to 67 of
67
with 100 triples per page.
- Errera_graph abstract "In the mathematical field of graph theory, the Errera graph is a graph with 17 vertices and 45 edges discovered by Alfred Errera. Published in 1921, it provides an example of how Kempe's proof of the four color theorem cannot work.Later, the Fritsch graph and Soifer graph provide two smaller counterexamples.The Errera graph is planar and has chromatic number 4, chromatic index 6, radius 3, diameter 4 and girth 3. All its vertices are of degree 5 or 6 and it is a 5-vertex-connected graph and a 5-edge-connected graph.".
- Errera_graph thumbnail Errera_graph_alt.svg?width=300.
- Errera_graph wikiPageID "24209919".
- Errera_graph wikiPageLength "2542".
- Errera_graph wikiPageOutDegree "28".
- Errera_graph wikiPageRevisionID "682470088".
- Errera_graph wikiPageWikiLink Alfred_Kempe.
- Errera_graph wikiPageWikiLink Category:4-chromatic_graphs.
- Errera_graph wikiPageWikiLink Category:Individual_graphs.
- Errera_graph wikiPageWikiLink Category:Planar_graphs.
- Errera_graph wikiPageWikiLink Characteristic_polynomial.
- Errera_graph wikiPageWikiLink Chromatic_index.
- Errera_graph wikiPageWikiLink Chromatic_number.
- Errera_graph wikiPageWikiLink Decagon.
- Errera_graph wikiPageWikiLink Diameter_(graph_theory).
- Errera_graph wikiPageWikiLink Dihedral_group.
- Errera_graph wikiPageWikiLink Distance_(graph_theory).
- Errera_graph wikiPageWikiLink Edge_(graph_theory).
- Errera_graph wikiPageWikiLink Edge_coloring.
- Errera_graph wikiPageWikiLink Four_color_theorem.
- Errera_graph wikiPageWikiLink Girth_(graph_theory).
- Errera_graph wikiPageWikiLink Graph_(mathematics).
- Errera_graph wikiPageWikiLink Graph_coloring.
- Errera_graph wikiPageWikiLink Graph_theory.
- Errera_graph wikiPageWikiLink Hamiltonian_graph.
- Errera_graph wikiPageWikiLink Hamiltonian_path.
- Errera_graph wikiPageWikiLink K-edge-connected_graph.
- Errera_graph wikiPageWikiLink K-vertex-connected_graph.
- Errera_graph wikiPageWikiLink Mathematics.
- Errera_graph wikiPageWikiLink Planar_graph.
- Errera_graph wikiPageWikiLink Radius_(graph_theory).
- Errera_graph wikiPageWikiLink Vertex-transitive_graph.
- Errera_graph wikiPageWikiLink Vertex_(graph_theory).
- Errera_graph wikiPageWikiLink File:Errera_graph_alt.svg.
- Errera_graph wikiPageWikiLinkText "Errera graph".
- Errera_graph automorphisms "20".
- Errera_graph chromaticIndex "6".
- Errera_graph chromaticNumber "4".
- Errera_graph diameter "4".
- Errera_graph edges "45".
- Errera_graph girth "3".
- Errera_graph hasPhotoCollection Errera_graph.
- Errera_graph imageCaption "The Errera graph".
- Errera_graph name "Errera graph".
- Errera_graph namesake "Alfred Errera".
- Errera_graph properties Hamiltonian_graph.
- Errera_graph properties Hamiltonian_path.
- Errera_graph properties Planar_graph.
- Errera_graph radius "3".
- Errera_graph vertices "17".
- Errera_graph wikiPageUsesTemplate Template:Infobox_graph.
- Errera_graph wikiPageUsesTemplate Template:Reflist.
- Errera_graph subject Category:4-chromatic_graphs.
- Errera_graph subject Category:Individual_graphs.
- Errera_graph subject Category:Planar_graphs.
- Errera_graph hypernym Graph.
- Errera_graph type Software.
- Errera_graph type Graph.
- Errera_graph comment "In the mathematical field of graph theory, the Errera graph is a graph with 17 vertices and 45 edges discovered by Alfred Errera. Published in 1921, it provides an example of how Kempe's proof of the four color theorem cannot work.Later, the Fritsch graph and Soifer graph provide two smaller counterexamples.The Errera graph is planar and has chromatic number 4, chromatic index 6, radius 3, diameter 4 and girth 3.".
- Errera_graph label "Errera graph".
- Errera_graph sameAs Graphe_dErrera.
- Errera_graph sameAs m.07kfgt_.
- Errera_graph sameAs Q3115469.
- Errera_graph sameAs Q3115469.
- Errera_graph wasDerivedFrom Errera_graph?oldid=682470088.
- Errera_graph depiction Errera_graph_alt.svg.
- Errera_graph isPrimaryTopicOf Errera_graph.