Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
From MaRDI portal
Publication:3439424
DOI10.1016/j.endm.2006.06.048zbMath1202.05080OpenAlexW1987089506MaRDI QIDQ3439424
Martin Škoviera, Edita Máčajová, Cajová
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.048
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing hypohamiltonian snarks with cyclic connectivity 5 and 6
- New flip-flop constructions for hypohamiltonian graphs
- Hypohamiltonian and hypotraceable graphs
- Classification and characterizations of snarks
- Snarks without small cycles
- Decompositions and reductions of snarks
- Flip-Flops in Hypohamiltonian Graphs
- Problem Session
This page was built for publication: Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6