Spanning even subgraphs of 3‐edge‐connected graphs (Q3652540)

From MaRDI portal
Revision as of 08:08, 2 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Spanning even subgraphs of 3‐edge‐connected graphs
scientific article

    Statements

    Spanning even subgraphs of 3‐edge‐connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    longest cycle
    0 references
    dominating cycle
    0 references
    edge degree
    0 references
    remote edges
    0 references
    triangle-free graph
    0 references
    bipartite graph
    0 references
    spanning even subgraph
    0 references
    bridgeless graphs
    0 references
    0 references