Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6

zbMATH Open1110.05057MaRDI QIDQ870078FDOQ870078

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

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
• Exponentially many hypohamiltonian snarks
• Superposition of snarks revisited
• On cyclic edge-connectivity of fullerenes
• Normal 5-edge-coloring of some snarks superpositioned by flower snarks
• Measures of edge-uncolorability of cubic graphs
• A unified approach to construct snarks with circular flow number 5
• Title not available (Why is that?)
• Infinitely many hypohamiltonian cubic graphs of girth 7

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)