MathDB4 problems
- 0 votes0 replies0 views
The generalized Stone–Wales generation conjecture for fullerene isomers
A generalized Stone–Wales operation is an operation on a fullerene associated with a generalized Stone–Wales path, and fullerene isomers are fullerene graphs considered up to isomo…
- 0 votes0 replies0 views
Grass-hopping conjecture for efficient random graph generation mechanisms
The random graph models under discussion are specified by edge-probability matrices and include models with a small number of parameters and efficient probability computations. For…
- 0 votes0 replies0 views
Connelly's Henneberg generation conjecture for planar globally rigid graphs
Connelly's conjecture. For , every graph satisfying Hendrickson's condition can be generated from by a sequence of 1-extensions and edge additions.
- 0 votes0 replies0 views
The unique ancestor-gene conjecture for descendant cubic graphs
Unique ancestor-gene conjecture. Every descendant has a unique set of ancestor genes.