A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4680152 / 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: Q3745851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular embeddings of complete graphs (neighborly maps) with 12 and 13 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BIEMBEDDINGS OF LATIN SQUARES AND HAMILTONIAN DECOMPOSITIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On biembeddings of Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive constructions for triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint on the biembedding of Latin squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\) / 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: Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773723 / rank
 
Normal rank

Latest revision as of 17:54, 2 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for the number of orientable triangular embeddings of some complete graphs
scientific article

    Statements

    A lower bound for the number of orientable triangular embeddings of some complete graphs (English)
    0 references
    0 references
    0 references
    21 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner triple system
    0 references
    Latin square
    0 references
    complete graph
    0 references
    triangular embedding
    0 references
    0 references