In the mathematical field of graph theory, the Szekeres snark is a snark with 50 vertices and 75 edges.[1] It was the fifth known snark, discovered by George Szekeres in 1973.[2]
As a snark, the Szekeres graph is a connected, bridgeless cubic graph with chromatic index equal to 4. The Szekeres snark is non-planar and non-hamiltonian but is hypohamiltonian.[3] It has book thickness 3 and queue number 2.[4]
Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989.[5]
^Weisstein, Eric W. "Szekeres Snark". MathWorld.
^Szekeres, G. (1973). "Polyhedral decompositions of cubic graphs". Bull. Austral. Math. Soc. 8 (3): 367–387. doi:10.1017/S0004972700042660.
^Weisstein, Eric W. "Hypohamiltonian Graph". MathWorld.
^Wolz, Jessica; Engineering Linear Layouts with SAT. Master Thesis, University of Tübingen, 2018
^Watkins, J. J. "Snarks." Ann. New York Acad. Sci. 576, 606-622, 1989.
1973. As a snark, the Szekeres graph is a connected, bridgeless cubic graph with chromatic index equal to 4. The Szekeressnark is non-planar and non-hamiltonian...
George Szekeres AM FAA (Hungarian: [ˈsɛkɛrɛʃ]; 29 May 1911 – 28 August 2005) was a Hungarian–Australian mathematician. Szekeres was born in Budapest, Hungary...
vertices is the Szekeres snark, the fifth known snark, discovered by George Szekeres in 1973. The chromatic number of the Watkins snark is 3. The chromatic...
known as snarks. They include the Petersen graph, Tietze's graph, the Blanuša snarks, the flower snark, the double-star snark, the Szekeressnark and the...
conjecture by finding a snark with a polyhedral embedding. Petersen coloring conjecture Tutte (1987). Itai & Rodeh (1978). Szekeres (1973). Seymour (1979)...
Statistics (1981-1985) George Szekeres, AM FAA, professor of pure mathematics, known for szekeressnark, Kruskal–Szekeres coordinates, Erdős–Szemerédi...
Press, pp. 44–46. Morris, Walter D.; Soltan, Valeriu (2000), "The Erdős-Szekeres problem on points in convex position—a survey", Bull. Amer. Math. Soc....
proportionally to the logarithm of the number of nodes N in the network snark A snark is a simple, connected, bridgeless cubic graph with chromatic index...
Global Information