On the lower bounds for the maximum genus for simple graphs (Q976145): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum genus and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound on the maximum genus of a simplicial graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284654 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum genus and girth of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4528367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum genus, connectivity and minimal degree of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization in of Upper-Embeddable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum genus, girth and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716822 / 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: On the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank

Revision as of 21:57, 2 July 2024

scientific article
Language Label Description Also known as
English
On the lower bounds for the maximum genus for simple graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references