Concept

Szekeres snark

In the mathematical field of graph theory, the Szekeres snark is a snark with 50 vertices and 75 edges. It was the fifth known snark, discovered by George Szekeres in 1973. 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. It has book thickness 3 and queue number 2. Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989. Image:Szekeres snark 3COL.svg|The [[chromatic number]] of the Szekeres snark is 3. Image:Szekeres snark 4color edge.svg|The [[chromatic index]] of the Szekeres snark is 4. Image:Szekeres-snark.svg|Alternative drawing of the Szekeres snark.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.