Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\) (Q2324490)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\)
scientific article

    Statements

    Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\) (English)
    0 references
    0 references
    0 references
    11 September 2019
    0 references
    embedding
    0 references
    genus
    0 references
    complete tripartite graph
    0 references
    complete bipartite graph
    0 references

    Identifiers