Self-dual embeddings of complete bipartite graphs (Q1193565): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q592090 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Dan S. Archdeacon / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0095-8956(92)90056-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2040374500 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The construction and classification of self-dual spherical polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-dual orientable embedding of \(K_n\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-dual embeddings of Cayley graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Orientable imbeddings of Cayley graphs / rank | |||
Normal rank |
Latest revision as of 14:18, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Self-dual embeddings of complete bipartite graphs |
scientific article |
Statements
Self-dual embeddings of complete bipartite graphs (English)
0 references
27 September 1992
0 references
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.
0 references
self-dual embeddings
0 references
complete bipartite graphs
0 references