Minimum genus embeddings of the complete graph (Q335320): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10114-016-5425-3 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A note on the number of graceful labellings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face 2-colourable triangular embeddings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential families of non-isomorphic triangulations of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular embeddings of complete graphs from graceful labellings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of nonisomorphic orientable regular embeddings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite set of torus triangulations of connectivity 5 whose graphs are not uniquely embeddable in the torus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three nonisomorphic triangulations of an orientable surface with the same complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many maximum genus embeddings and genus embeddings for complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum genus of graphs of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10114-016-5425-3 / rank
 
Normal rank

Latest revision as of 14:41, 9 December 2024

scientific article
Language Label Description Also known as
English
Minimum genus embeddings of the complete graph
scientific article

    Statements

    Minimum genus embeddings of the complete graph (English)
    0 references
    0 references
    0 references
    2 November 2016
    0 references
    maximum genus embedding
    0 references
    minimum genus embedding
    0 references
    complete graph
    0 references
    current graph
    0 references

    Identifiers