Snark (Graphentheorie) (German Wikipedia)

Analysis of information sources in references of the Wikipedia article "Snark (Graphentheorie)" in German language version.

refsWebsite
Global rank German rank
2nd place
3rd place
513th place
549th place
26th place
153rd place
6th place
40th place

archive.org

  • Julius Petersen: Sur le théorème de Tait. In: L'Intermédiaire des Mathématiciens. Band 5, 1898, S. 225–227 (archive.org).

doi.org

  • Martin Gardner: Snarks, boojums, and other conjectures related to the four-color-map theorem. In: Scientific American. Band 234, Nr. 4, 1976, S. 126–130, doi:10.1038/scientificamerican0476-126, JSTOR:24950334.
  • Peter G. Tait: Remarks on the colourings of maps. In: Proceedings of the Royal Society of Edinburgh. Band 10, 1880, S. 729, doi:10.1017/S0370164600044643.
  • In the study of various important and difficult problems in graph theory (such as the cycle double cover conjecture and the 5-flow conjecture), one encounters an interesting but somewhat mysterious variety of graphs called snarks. In spite of their simple definition...and over a century long investigation, their properties and structure are largely unknown. Siehe Miroslav Chladný, Martin Škoviera: Factorisation of snarks. In: Electronic Journal of Combinatorics. Band 17, 2010, S. R32, doi:10.37236/304.
  • Sarah-Marie Belcastro: The continuing saga of snarks. In: The College Mathematics Journal. Band 43, Nr. 1, 2012, S. 82–87, doi:10.4169/college.math.j.43.1.082.

jstor.org

wolfram.com

mathworld.wolfram.com

  • Ed Pegg, Jr. et al., Wolfram MathWorld: Snark