Quadrangular embeddings of the complete even k-partite graph

Autor:	Gerhard Ringel, N. Hartsfield
Rok vydání:	1990
Předmět:	Discrete mathematics Symmetric graph 1-planar graph Theoretical Computer Science Combinatorics Windmill graph Petersen graph Graph minor Discrete Mathematics and Combinatorics Complement graph MathematicsofComputing_DISCRETEMATHEMATICS Forbidden graph characterization Mathematics Toroidal graph
Zdroj:	Discrete Mathematics. 81:19-23
ISSN:	0012-365X
DOI:	10.1016/0012-365x(90)90175-h
Popis:	The complete even k -partite graph K n1 , n2 ,…, n k is the complete k -partite graph where all the n i 's are even numbers. Orientable and nonorientable quadrangular embeddings are constructed for all these graphs.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::538c8d6508011fab4b507b4378024627 https://doi.org/10.1016/0012-365x(90)90175-h Zobrazit plný text záznamu