Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6470127> ?p ?o }
Showing triples 1 to 58 of
58
with 100 triples per page.
- Q6470127 subject Q7016011.
- Q6470127 subject Q7217193.
- Q6470127 subject Q8498914.
- Q6470127 subject Q8647012.
- Q6470127 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".
- Q6470127 thumbnail Flower_snarkv.svg?width=300.
- Q6470127 wikiPageExternalLink pp914.ps.
- Q6470127 wikiPageWikiLink Q1050972.
- Q6470127 wikiPageWikiLink Q1079681.
- Q6470127 wikiPageWikiLink Q1128435.
- Q6470127 wikiPageWikiLink Q131476.
- Q6470127 wikiPageWikiLink Q1374495.
- Q6470127 wikiPageWikiLink Q1391861.
- Q6470127 wikiPageWikiLink Q1396427.
- Q6470127 wikiPageWikiLink Q1531456.
- Q6470127 wikiPageWikiLink Q167420.
- Q6470127 wikiPageWikiLink Q170790.
- Q6470127 wikiPageWikiLink Q177504.
- Q6470127 wikiPageWikiLink Q184410.
- Q6470127 wikiPageWikiLink Q2159915.
- Q6470127 wikiPageWikiLink Q2226822.
- Q6470127 wikiPageWikiLink Q230655.
- Q6470127 wikiPageWikiLink Q2532492.
- Q6470127 wikiPageWikiLink Q273037.
- Q6470127 wikiPageWikiLink Q3050606.
- Q6470127 wikiPageWikiLink Q3115539.
- Q6470127 wikiPageWikiLink Q3115577.
- Q6470127 wikiPageWikiLink Q3487135.
- Q6470127 wikiPageWikiLink Q3487138.
- Q6470127 wikiPageWikiLink Q3487139.
- Q6470127 wikiPageWikiLink Q38082.
- Q6470127 wikiPageWikiLink Q395.
- Q6470127 wikiPageWikiLink Q4924839.
- Q6470127 wikiPageWikiLink Q510153.
- Q6470127 wikiPageWikiLink Q5198159.
- Q6470127 wikiPageWikiLink Q5218370.
- Q6470127 wikiPageWikiLink Q5219586.
- Q6470127 wikiPageWikiLink Q5263683.
- Q6470127 wikiPageWikiLink Q5462247.
- Q6470127 wikiPageWikiLink Q547823.
- Q6470127 wikiPageWikiLink Q5597085.
- Q6470127 wikiPageWikiLink Q568585.
- Q6470127 wikiPageWikiLink Q584521.
- Q6470127 wikiPageWikiLink Q677706.
- Q6470127 wikiPageWikiLink Q7016011.
- Q6470127 wikiPageWikiLink Q7066659.
- Q6470127 wikiPageWikiLink Q7217193.
- Q6470127 wikiPageWikiLink Q728415.
- Q6470127 wikiPageWikiLink Q742536.
- Q6470127 wikiPageWikiLink Q835614.
- Q6470127 wikiPageWikiLink Q8498914.
- Q6470127 wikiPageWikiLink Q8647012.
- Q6470127 wikiPageWikiLink Q898670.
- Q6470127 wikiPageWikiLink Q905837.
- Q6470127 wikiPageWikiLink Q959831.
- Q6470127 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.".
- Q6470127 label "Snark (graph theory)".
- Q6470127 depiction Flower_snarkv.svg.
