A note on the maximum genus of 3-edge-connected nonsimple graphs (Q1589799): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s11766-000-0047-y / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4716822 / 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 / cites work
 
Property / cites work: A Characterization in of Upper-Embeddable Graphs / 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: Maximum genus and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum genus on a 3-vertex-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3899969 / 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: Q3837101 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11766-000-0047-Y / rank
 
Normal rank

Latest revision as of 21:56, 10 December 2024

scientific article
Language Label Description Also known as
English
A note on the maximum genus of 3-edge-connected nonsimple graphs
scientific article

    Statements

    A note on the maximum genus of 3-edge-connected nonsimple graphs (English)
    0 references
    10 May 2001
    0 references
    surface
    0 references
    cellular embedding
    0 references
    Betti defficiency
    0 references
    maximum genus
    0 references
    Betti number
    0 references
    0 references

    Identifiers