Spanning Eulerian subgraphs of bounded degree in triangulations (Q1334938)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Spanning Eulerian subgraphs of bounded degree in triangulations
scientific article

    Statements

    Spanning Eulerian subgraphs of bounded degree in triangulations (English)
    0 references
    0 references
    0 references
    0 references
    26 September 1994
    0 references
    A closed \(k\)-trail is a spanning Eulerian subgraph with maximum degree at most \(2k\). The main result states that every triangulation of a disk or an annulus has a closed 4-trail. Since every triangulation in the projective plane, the torus and the Klein bottle has a spanning subgraph which triangulates an annulus, this implies that all triangulations in the projective plane, the torus and the Klein bottle have closed 4- trails. The same holds for 5-connected triangulations in the double-torus with representativity at least 6.
    0 references
    0 references
    \(k\)-trail
    0 references
    spanning Eulerian subgraph
    0 references
    triangulation
    0 references
    projective plane
    0 references
    torus
    0 references
    Klein bottle
    0 references