Self-dual embeddings of complete bipartite graphs
type: Item
instance of: scholarly article
title: Self-dual embeddings of complete bipartite graphs
zbMATH Open document ID: 0757.05046
DOI: 10.1016/0095-8956(92)90056-4
author: Nora Hartsfield
author: Dan S. Archdeacon
published in: Journal of Combinatorial Theory. Series B
publication date: 1992-09-27T00:00:00Z
review text: It is shown that, in both the orientable and the nonorientable sense, \(K_{n,m}\) has a self-dual imbedding if and only if \(n\) and \(m\) are both even integers exceeding 2, except that \(K_{6,6}\) has no orientable self-dual imbedding. The latter claim was verified by an exhaustive computer search. The requisite constructions for the other cases use a ``cut and paste'' procedure to join two self-dual imbeddings into one larger self-dual imbedding.
reviewed by: Arthur T. White
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 64853
zbMATH Keywords: self-dual embeddings
zbMATH Keywords: complete bipartite graphs
MaRDI profile type: Publication
full work available at URL: 0095-8956(92)90056-4
OpenAlex ID: W2040374500
cites work: The construction and classification of self-dual spherical polyhedra
cites work: Self-dual orientable embedding of \(K_n\)
cites work: Self-dual embeddings of Cayley graphs
cites work: Orientable imbeddings of Cayley graphs
description: scientific article; zbMATH DE number 64853