The following pages link to The Generation of Fullerenes (Q5403062):
Displaying 26 items.
- snarkhunter (Q38694) (← links)
- Transforming phylogenetic networks: moving beyond tree space (Q307586) (← links)
- Generation of various classes of trivalent graphs (Q391389) (← links)
- Secure sets and their expansion in cubic graphs (Q403188) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Recursive generation of IPR fullerenes (Q498482) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- Enumeration of Seidel matrices (Q1686262) (← links)
- On the smallest snarks with oddness 4 and connectivity 2 (Q1753089) (← links)
- Extremal cubic graphs for fault-tolerant locating domination (Q2143147) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Existence of regular nut graphs for degree at most 11 (Q2296003) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- A counterexample to the pseudo 2-factor isomorphic graph conjecture (Q2354717) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION (Q5151447) (← links)
- Graphs with few hamiltonian cycles (Q5207451) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- Enumerating Steiner triple systems (Q6064438) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- Progress on fault-tolerant locating-dominating sets (Q6174163) (← links)
- <i>K</i><sub>2</sub>‐Hamiltonian graphs: II (Q6199383) (← links)
- Generation and new infinite families of \(K_2\)-hypohamiltonian graphs (Q6542014) (← links)
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs (Q6585253) (← links)
