Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6

MaRDI QIDQ870078zbMATH OpenFDO

Authors E. Máčajová, Martin Škoviera

Publication date 12 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/127210, http://www.emis.de/journals/EJC/Volume_14/Abstracts/v14i1r18.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
• scientific article; zbMATH DE number 3849273
• Exponentially many hypohamiltonian snarks
• scientific article; zbMATH DE number 3884206
• Hypohamiltonian planar cubic graphs with girth 5

Cited in

(10)

• Normal 5-edge-coloring of some snarks superpositioned by flower snarks
• On cyclic edge-connectivity of fullerenes
• Superposition of snarks revisited
• On hypohamiltonian snarks and a theorem of Fiorini
• A unified approach to construct snarks with circular flow number 5
• Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
• Exponentially many hypohamiltonian snarks
• Measures of edge-uncolorability of cubic graphs
• Infinitely many hypohamiltonian cubic graphs of girth 7
• scientific article; zbMATH DE number 3849273 (Why is no real title available?)

This page was built for publication: Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870078)