Exponentially many maximum genus embeddings and genus embeddings for complete graphs (Q1042786): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s11425-007-0194-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087944085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / 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: Q4773723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequence representation for maps / 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: Uniqueness and faithfulness of embedding of toroidal graphs / 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: 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: On the number of nonisomorphic orientable regular embeddings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) / rank
 
Normal rank

Latest revision as of 05:57, 2 July 2024

scientific article
Language Label Description Also known as
English
Exponentially many maximum genus embeddings and genus embeddings for complete graphs
scientific article

    Statements

    Exponentially many maximum genus embeddings and genus embeddings for complete graphs (English)
    0 references
    0 references
    0 references
    7 December 2009
    0 references
    maximum genus
    0 references
    embeddings
    0 references
    complete graph
    0 references

    Identifiers