In the mathematical field of graph theory, the Watkins snark is a snark with 50 vertices and 75 edges.[1][2] It was discovered by John J. Watkins in 1989.[3]
As a snark, the Watkins graph is a connected, bridgeless cubic graph with chromatic index equal to 4. The Watkins snark is also non-planar and non-hamiltonian. It has book thickness 3 and queue number 2.[4]
Another well known snark on 50 vertices is the Szekeres snark, the fifth known snark, discovered by George Szekeres in 1973.[5]
^Weisstein, Eric W. "Watkins Snark". MathWorld.
^Watkins, J. J. and Wilson, R. J. "A Survey of Snarks." In Graph Theory, Combinatorics, and Applications (Ed. Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk). New York: Wiley, pp. 1129-1144, 1991
^Watkins, J. J. "Snarks." Ann. New York Acad. Sci. 576, 606-622, 1989.
^Wolz, Jessica; Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018
^Szekeres, G. (1973). "Polyhedral decompositions of cubic graphs". Bull. Austral. Math. Soc. 8 (3): 367–387. doi:10.1017/S0004972700042660.
theory, the Watkinssnark is a snark with 50 vertices and 75 edges. It was discovered by John J. Watkins in 1989. As a snark, the Watkins graph is a connected...
her parents' divorce, Watkins' mother obtained a marketing degree and relocated the family to Boston when Watkins was 15. Watkins attended Moses DeWitt...
double-star snark, the Szekeres snark and the Watkinssnark. There is an infinite number of distinct snarks. Cubic graphs arise naturally in topology in...
the Watkinssnark discovered by John J. Watkins in 1989. The chromatic number of the Szekeres snark is 3. The chromatic index of the Szekeres snark is...
the Petersen graph is a snark. It is the smallest possible snark, and was the only known snark from 1898 until 1946. The snark theorem, a result conjectured...
SM-62 Snark in Florida. Later moving to Maine as an operational unit, it was inactivated in 1959 when Strategic Air Command reorganized its Snark missile...
1950 by H. S. M. Coxeter and was given its name in 1969 by Mark Watkins. In Watkins' notation, G(n, k) is a graph with vertex set { u 0 , u 1 , … , u...
theorem is equivalent to the statement that a certain type of graph (called a snark in modern terminology) must be non-planar. In 1943, Hugo Hadwiger formulated...
over Fitch's Pond H (Apr. 1944) 221 H-221 Jack London The Cruise of the Snark H (Apr. 1944) 222 H-222 Eugene Cunningham Riders of the Night H (Apr. 1944)...
August 1944 1240 Metcalfe Henry Wood UK 1864 1944 1241 Starr Wood, aka 'The Snark' UK 1 February 1870 2 September 1944 1242 Ernest Henry James Woodard UK...
resort where the Watkins family owned a holiday villa. The name had previously been used on an earlier tug owned by William Watkins which taken part in...
(L'Expédition) Roxanne Starr - (letterer for various comics) Philippe Sternis - (Snark Saga, Mouche) Jean Tabary - (Iznogoud, Richard et Charlie, Grabadu et Gabaliouchtou...
Society-sounding name, the Humane Society for Shelter Pets. Its website snarks at the Humane Society for failing to provide more money for animal shelters...
Richardson, American comic artist (Maxor, Fever Dreams, The Hunting of the Snark) and author of The Complete Book of Cartooning, dies at age 81. August 12:...
Global Information