Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs

Abstract

Weconstruct a family of recursive constructions such that for any i ∈ {0, 1, 3, 4, 6, 7, 9, 10} and j ∈ {0, 1, . . . , 11}, several arbitrary nonorientable triangular embeddings of every complete graph Km, m ≡ i (mod 12), can be incorporated into a minimal nonorientable embedding of Km̄, m̄ ≡ j (mod 12). The existence of such recursive constructions implies… (More)
DOI: 10.1016/j.disc.2015.05.024

Topics

10 Figures and Tables