Splitting lemma for 2-connected graphs (Q1935986)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Splitting lemma for 2-connected graphs
scientific article

    Statements

    Splitting lemma for 2-connected graphs (English)
    0 references
    0 references
    21 February 2013
    0 references
    Summary: Using a splitting operation and a splitting lemma for connected graphs, Fleischner characterized connected Eulerian graphs [\textit{H. Fleischner}, Eulerian graphs and related topics, Part 1, Volume 1, Ann. Discrete Math. 50 (1991; Zbl 0792.05092)]. In this paper, we obtain a splitting lemma for 2-connected graphs and characterize 2-connected Eulerian graphs. As a consequence, we characterize connected graphic Eulerian matroids.
    0 references
    splitting operation
    0 references
    splitting lemma
    0 references
    connected graphs
    0 references
    Eulerian graphs
    0 references
    connected graphic Eulerian matroids
    0 references

    Identifiers

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