Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Snark_(graph_theory)> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- Snark_(graph_theory) abstract "In the mathematical field of graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by only three colors without two edges of the same color meeting at a point. (By Vizing's theorem, the chromatic index of a cubic graph is 3 or 4.) In order to avoid trivial cases, snarks are often restricted to have girth at least 5.Writing in The Electronic Journal of Combinatorics, Miroslav Chladný states that".
- Snark_(graph_theory) thumbnail Flower_snarkv.svg?width=300.
- Snark_(graph_theory) wikiPageExternalLink pp914.ps.
- Snark_(graph_theory) wikiPageID "727811".
- Snark_(graph_theory) wikiPageRevisionID "601346675".
- Snark_(graph_theory) hasPhotoCollection Snark_(graph_theory).
- Snark_(graph_theory) title "Snark".
- Snark_(graph_theory) urlname "Snark".
- Snark_(graph_theory) subject Category:Graph_coloring.
- Snark_(graph_theory) subject Category:Graph_families.
- Snark_(graph_theory) subject Category:Graph_minor_theory.
- Snark_(graph_theory) subject Category:Regular_graphs.
- Snark_(graph_theory) type Abstraction100002137.
- Snark_(graph_theory) type Family108078020.
- Snark_(graph_theory) type GraphFamilies.
- Snark_(graph_theory) type Group100031264.
- Snark_(graph_theory) type Organization108008335.
- Snark_(graph_theory) type SocialGroup107950920.
- Snark_(graph_theory) type Unit108189659.
- Snark_(graph_theory) type YagoLegalActor.
- Snark_(graph_theory) type YagoLegalActorGeo.
- Snark_(graph_theory) type YagoPermanentlyLocatedEntity.
- Snark_(graph_theory) comment "In the mathematical field of graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by only three colors without two edges of the same color meeting at a point.".
- Snark_(graph_theory) label "Snark (graph theory)".
- Snark_(graph_theory) label "Snark (graphe)".
- Snark_(graph_theory) label "Snark (teoria dei grafi)".
- Snark_(graph_theory) label "Żmirłacz (teoria grafów)".
- Snark_(graph_theory) label "Снарк (теория графов)".
- Snark_(graph_theory) sameAs Snark_(graphe).
- Snark_(graph_theory) sameAs Snark_(teoria_dei_grafi).
- Snark_(graph_theory) sameAs Żmirłacz_(teoria_grafów).
- Snark_(graph_theory) sameAs m.03644m.
- Snark_(graph_theory) sameAs Q6470127.
- Snark_(graph_theory) sameAs Q6470127.
- Snark_(graph_theory) sameAs Snark_(graph_theory).
- Snark_(graph_theory) wasDerivedFrom Snark_(graph_theory)?oldid=601346675.
- Snark_(graph_theory) depiction Flower_snarkv.svg.
- Snark_(graph_theory) isPrimaryTopicOf Snark_(graph_theory).
