Matches in DBpedia 2015-10 for { ?s ?p "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.Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- Szekeres_snark abstract "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.Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989.".
- Szekeres_snark comment "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.Another well known snark on 50 vertices is the Watkins snark discovered by John J. Watkins in 1989.".