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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2009.11.001 / rank
Normal rank
 
Property / author
 
Property / author: Zhang Dong Ouyang / rank
 
Normal rank
Property / author
 
Property / author: Yuan Qiu Huang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2009.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088375151 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2009.11.001 / rank
 
Normal rank

Latest revision as of 10:53, 10 December 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