Generation of cubic graphs
From MaRDI portal
Abstract: We describe an efficient new algorithm for the generation of fullerenes. Our implementation of this algorithm is more than 3.5 times faster than the previously fastest generator for fullerenes -- fullgen -- and the first program since fullgen to be useful for more than 100 vertices. We also note a programming error in fullgen that caused problems for 136 or more vertices. We tabulate the numbers of fullerenes and IPR fullerenes up to 400 vertices. We also check up to 316 vertices a conjecture of Barnette that cubic planar graphs with maximum face size 6 are hamiltonian and verify that the smallest counterexample to the spiral conjecture has 380 vertices.
Recommendations
Cited in
(40)- Graph structural properties of non-Yutsis graphs allowing fast recognition
- Spanning cubic graph designs
- 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
- Genetic theory for cubic graphs
- Fault-tolerant detectors for distinguishing sets in cubic graphs
- Transforming phylogenetic networks: moving beyond tree space
- scientific article; zbMATH DE number 4158673 (Why is no real title available?)
- scientific article; zbMATH DE number 3952807 (Why is no real title available?)
- snarkhunter
- Generation of various classes of trivalent graphs
- Secure sets and their expansion in cubic graphs
- Improved bounds for hypo-Hamiltonian graphs
- Generation and properties of snarks
- Fast generation of cubic graphs
- Recursive generation of IPR fullerenes
- Constructing all nonisomorphic supergraphs with isomorphism rejection
- Graphs with few Hamiltonian cycles
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Generation of cubic graphs and snarks with large girth
- 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
- K2‐Hamiltonian graphs: II
- Generation and new infinite families of \(K_2\)-hypohamiltonian graphs
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
- Measures of edge-uncolorability of cubic graphs
- Fault-tolerant locating-dominating sets with error-correction
- On (k,g)-graphs without (g + 1)-cycles
- To be or not to be Yutsis: algorithms for the decision problem
- Cubic graphs with edges in exactly one perfect matching
- The cycle counts of graphs
- Network fault costs based on minimum leaf spanning trees
- Integer sequence discovery from small graphs
This page was built for publication: Generation of cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403062)
