Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs

DOI10.1016/j.disc.2015.05.024zbMath1318.05045MaRDI QIDQ2515556

Vladimir P. Korzhik

Publication date: 5 August 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.05.024

zbMATH Keywords

complete graph; topological embedding; minimal embedding; triangular embedding; nonisomorphic embeddings

Mathematics Subject Classification ID

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)