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
Improved bounds for hypohamiltonian graphs, CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION, Graphs with few hamiltonian cycles, Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44, Breaking symmetries with high dimensional graph invariants and their combination, Enumerating Steiner triple systems, Square Coloring Planar Graphs with Automatic Discharging, Progress on fault-tolerant locating-dominating sets, snarkhunter, Transforming phylogenetic networks: moving beyond tree space, Generation of various classes of trivalent graphs, Secure sets and their expansion in cubic graphs, Generation and properties of snarks, Recursive generation of IPR fullerenes, Measures of edge-uncolorability of cubic graphs, Integer sequence discovery from small graphs, Enumeration of Seidel matrices, On the smallest snarks with oddness 4 and connectivity 2, Extremal cubic graphs for fault-tolerant locating domination, Switching 3-edge-colorings of cubic graphs, Existence of regular nut graphs for degree at most 11, On the minimum leaf number of cubic graphs, A counterexample to the pseudo 2-factor isomorphic graph conjecture, Fault-tolerant detectors for distinguishing sets in cubic graphs
Uses Software
