The Generation of Fullerenes
From MaRDI portal
Publication:5403062
zbMath1283.05256arXiv1207.7010MaRDI QIDQ5403062
Jan Goedgebeur, Brendan D. McKay, Gunnar Brinkmann
Publication date: 25 March 2014
Full work available at URL: https://arxiv.org/abs/1207.7010
Related Items (25)
Transforming phylogenetic networks: moving beyond tree space ⋮ Extremal cubic graphs for fault-tolerant locating domination ⋮ Switching 3-edge-colorings of cubic graphs ⋮ Fault-tolerant detectors for distinguishing sets in cubic graphs ⋮ Generation of various classes of trivalent graphs ⋮ Enumeration of Seidel matrices ⋮ Breaking symmetries with high dimensional graph invariants and their combination ⋮ Secure sets and their expansion in cubic graphs ⋮ Enumerating Steiner triple systems ⋮ Square Coloring Planar Graphs with Automatic Discharging ⋮ Progress on fault-tolerant locating-dominating sets ⋮ K2‐Hamiltonian graphs: II ⋮ Improved bounds for hypohamiltonian graphs ⋮ Integer sequence discovery from small graphs ⋮ Generation and properties of snarks ⋮ Measures of edge-uncolorability of cubic graphs ⋮ CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION ⋮ Recursive generation of IPR fullerenes ⋮ On the smallest snarks with oddness 4 and connectivity 2 ⋮ Graphs with few hamiltonian cycles ⋮ Existence of regular nut graphs for degree at most 11 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ snarkhunter ⋮ On the minimum leaf number of cubic graphs ⋮ A counterexample to the pseudo 2-factor isomorphic graph conjecture
Uses Software
This page was built for publication: The Generation of Fullerenes
