Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (Q659679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Triangular embeddings of complete graphs from graceful labellings of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5421812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / 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: Q4773723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of maximum genus embeddings of almost all graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Region distributions of some small diameter graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph genus problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank

Revision as of 20:22, 4 July 2024

scientific article
Language Label Description Also known as
English
Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)
scientific article

    Statements

    Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) (English)
    0 references
    0 references
    0 references
    24 January 2012
    0 references
    maximum orientable genus embedding (MGE)
    0 references
    current graph
    0 references
    optimal tree
    0 references
    graceful labeling
    0 references

    Identifiers