Spanning even subgraphs of 3‐edge‐connected graphs (Q3652540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even subgraphs of bridgeless graphs and 2-factors of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows and generalized coloring theorems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superposition and constructions of graphs without nowhere-zero \(k\)-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian line graphs and connectivity / rank
 
Normal rank

Latest revision as of 08:08, 2 July 2024

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