On the number of genus embeddings of complete bipartite graphs (Q2637736): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Orientable and non orientable genus of the complete bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular embeddings of \(K_{n,n}\) where \(n\) is a power of 2. I: Metacyclic case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular embeddings of \(K_{n,n}\) where \(n\) is an odd prime power / 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: Three nonisomorphic triangulations of an orientable surface with the same complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequence representation for maps / 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: Das Geschlecht des vollständigen paaren Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph genus problem is NP-complete / rank
 
Normal rank

Latest revision as of 08:09, 7 July 2024

scientific article
Language Label Description Also known as
English
On the number of genus embeddings of complete bipartite graphs
scientific article

    Statements

    Identifiers