The closed 2-cell embeddings of 2-connected doubly toroidal graphs (Q1901046): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Face colorings of embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-embedding of projective-planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972954 / rank
 
Normal rank

Latest revision as of 17:56, 23 May 2024

scientific article
Language Label Description Also known as
English
The closed 2-cell embeddings of 2-connected doubly toroidal graphs
scientific article

    Statements

    The closed 2-cell embeddings of 2-connected doubly toroidal graphs (English)
    0 references
    0 references
    29 October 1995
    0 references
    An embedding of a graph \(G\) in a surface \(S\) is called a closed 2-cell embedding if the topological closure of each face of the embedding is homeomorphic to a closed disc. It is proved in this paper that if a 2- connected graph \(G\) can be embedded in a double torus, then \(G\) must have a closed 2-cell embedding in some surface. An immediate corollary of the main theorem is that if a 2-connected graph \(G\) can be embedded in a double torus, then \(G\) has a circuit double cover.
    0 references
    0 references
    surface
    0 references
    double torus
    0 references
    2-cell embedding
    0 references
    circuit double cover
    0 references
    0 references
    0 references
    0 references
    0 references