A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (Q5151496): Difference between revisions

Latest revision as of 15:10, 24 July 2024

scientific article; zbMATH DE number 7313294

Language	Label	Description	Also known as
English	A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s	scientific article; zbMATH DE number 7313294

Statements

instance of

scholarly article

0 references

title

A simple construction of exponentially many nonisomorphic orientable triangular embeddings of K_12s (English)

0 references

author

Vladimir P. Korzhik

0 references

published in

The Art of Discrete and Applied Mathematics

0 references

publication date

19 February 2021

0 references

zbMATH Keywords

topological embedding

0 references

complete graph

0 references

nonisomorphic embeddings

0 references

triangular embedding

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.26493/2590-9770.1387.a84

0 references

cites work

Exponential families of non-isomorphic triangulations of complete graphs

0 references

A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs

0 references

Recursive constructions for triangulations

0 references

A lower bound for the number of orientable triangular embeddings of some complete graphs

0 references

On the number of triangular embeddings of complete graphs and complete tripartite graphs

0 references

Q3757929

0 references

On the number of nonisomorphic orientable regular embeddings of complete graphs

0 references

Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.

0 references

Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)

0 references

Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)

0 references

Q4773723

0 references

A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices

0 references

Identifiers

zbMATH Open document ID

1454.05032

0 references

DOI

10.26493/2590-9770.1387.a84

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5151496

@@ Property / cites work @@
+Exponential families of non-isomorphic triangulations of complete graphs
+Normal rank
@@ Property / cites work @@
+A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
+Normal rank
@@ Property / cites work @@
+Recursive constructions for triangulations
@@ Property / cites work: Recursive constructions for triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the number of orientable triangular embeddings of some complete graphs
+Normal rank
@@ Property / cites work @@
+On the number of triangular embeddings of complete graphs and complete tripartite graphs
+Normal rank
@@ Property / cites work @@
+Q3757929
@@ Property / cites work: Q3757929 / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of nonisomorphic orientable regular embeddings of complete graphs
+Normal rank
@@ Property / cites work @@
+Exponential families of non-isomorphic non-triangular orientable genus embeddings of complete graphs.
+Normal rank
@@ Property / cites work @@
+Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s}\)
+Normal rank
@@ Property / cites work @@
+Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\)
+Normal rank
@@ Property / cites work @@
+Q4773723
@@ Property / cites work: Q4773723 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple construction for orientable triangular embeddings of the complete graphs on \(12 s\) vertices
+Normal rank