Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Meredith_graph> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Meredith_graph abstract "In the mathematical field of graph theory, the Meredith graph is a 4-regular undirected graph with 70 vertices and 140 edges discovered by Guy H. J. Meredith in 1973.The Meredith graph is 4-vertex-connected and 4-edge-connected, has chromatic number 3, chromatic index 5, radius 7, diameter 8, girth 4 and is non-hamiltonian.Published in 1973, it provides a counterexample to the Crispin Nash-Williams conjecture that every 4-regular 4-vertex-connected graph is Hamiltonian. However, W. T. Tutte showed that all 4-connected planar graphs are hamiltonian.The characteristic polynomial of the Meredith graph is .".
- Meredith_graph thumbnail Meredith_graph.svg?width=300.
- Meredith_graph wikiPageID "24128464".
- Meredith_graph wikiPageRevisionID "545711928".
- Meredith_graph chromaticIndex "5".
- Meredith_graph chromaticNumber "3".
- Meredith_graph diameter "8".
- Meredith_graph edges "140".
- Meredith_graph girth "4".
- Meredith_graph hasPhotoCollection Meredith_graph.
- Meredith_graph imageCaption "The Meredith graph".
- Meredith_graph name "Meredith graph".
- Meredith_graph namesake "G. H. Meredith".
- Meredith_graph properties Eulerian_path.
- Meredith_graph radius "7".
- Meredith_graph vertices "70".
- Meredith_graph subject Category:Individual_graphs.
- Meredith_graph subject Category:Regular_graphs.
- Meredith_graph type Abstraction100002137.
- Meredith_graph type Communication100033020.
- Meredith_graph type Graph107000195.
- Meredith_graph type IndividualGraphs.
- Meredith_graph type RegularGraphs.
- Meredith_graph type VisualCommunication106873252.
- Meredith_graph comment "In the mathematical field of graph theory, the Meredith graph is a 4-regular undirected graph with 70 vertices and 140 edges discovered by Guy H. J. Meredith in 1973.The Meredith graph is 4-vertex-connected and 4-edge-connected, has chromatic number 3, chromatic index 5, radius 7, diameter 8, girth 4 and is non-hamiltonian.Published in 1973, it provides a counterexample to the Crispin Nash-Williams conjecture that every 4-regular 4-vertex-connected graph is Hamiltonian. However, W. T.".
- Meredith_graph label "Graphe de Meredith".
- Meredith_graph label "Meredith graph".
- Meredith_graph sameAs Graphe_de_Meredith.
- Meredith_graph sameAs m.07k8030.
- Meredith_graph sameAs Q3115517.
- Meredith_graph sameAs Q3115517.
- Meredith_graph sameAs Meredith_graph.
- Meredith_graph wasDerivedFrom Meredith_graph?oldid=545711928.
- Meredith_graph depiction Meredith_graph.svg.
- Meredith_graph isPrimaryTopicOf Meredith_graph.