2 problems
Let be an involutive polyhedral graph: a self-dual polyhedral graph equipped with an involution satisfying and . A Re…
Let be the set of all irreducible polyhedral graphs with rigid vertices. Finiteness conjecture. Each set is finite. Th…
Let be an involutive polyhedral graph: a self-dual polyhedral graph equipped with an involution satisfying and . A Re…
Let be the set of all irreducible polyhedral graphs with rigid vertices. Finiteness conjecture. Each set is finite. Th…