Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Snarks and Non-Hamiltonian Cubic 2-Edge-Connected Graphs of Small Order

David A. Pike1
1Department of Discrete and Statistical Sciences Auburn University, Auburn, Alabama, USA. 36849-5307
  • Published: 28/02/1997

Abstract

All non-Hamiltonian cubic \(2\)-edge-connected graphs, including all snarks, on \(16\) or fewer vertices are listed, along with some of their properties. Questions concerning the existence of graphs with certain properties are posed.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
David A. Pike. Snarks and Non-Hamiltonian Cubic 2-Edge-Connected Graphs of Small Order[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 023. 129-141. DOI: .