Genus embeddings of a type of graph (Q949340): 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: Exponentially many nonisomorphic orientable triangular embeddings of \(K_{12s+3}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273160 / 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: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genus embeddings for some complete tripartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph genus problem is NP-complete / rank
 
Normal rank

Revision as of 17:38, 28 June 2024

scientific article
Language Label Description Also known as
English
Genus embeddings of a type of graph
scientific article

    Statements

    Identifiers