Revision as of 22:15, 20 November 2017 edit Tom.Reding (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, Template editors 4,364,437 edits m →top: Rep typographic ligature "ﬁ" with plain text; possible ref cleanup; WP:GenFixes on, replaced: ﬁ → fi using AWB ← Previous edit		Revision as of 02:29, 11 January 2018 edit undo RProgrammer (talk \| contribs) 429 edits Also added bridgelessness into the everyday definition :3 Next edit →
Line 3: [[Image:Flower snarkv.svg\|thumb\|right\|The [[flower snark]] J<sub>5</sub> is one of six snarks on 20 vertices.]] In the [[mathematics\|mathematical]] field of [[graph theory]], a '''snark''' is a [[Graph (discrete mathematics)#Simple graph\|simple]], [[Connectivity (graph theory)\|connected]], [[Bridge (graph theory)\|bridgeless]] [[cubic graph]] with [[chromatic index]] equal to 4. In other words, it is a graph in which every vertex has three neighbors, the connectivity is redundant so that removing no one edge would split the graph, 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 (graph theory)\|girth]] at least 5. Writing in [[The Electronic Journal of Combinatorics]], [[Miroslav Chladný]] states that

Snark (graph theory): Difference between revisions