Even-cycle decompositions of graphs with no odd-\(K_4\)-minor (Q2400967): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Some of) the many uses of Eulerian graphs in graph theory (plus some applications) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly bipartite graphs and the max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of weakly bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even circuits in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of the matroids with the max-flow min-cut property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to ``A decomposition of the matroids with the max-flow min-cut property'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On even circuit decompositions of eulerian graphs / rank
 
Normal rank

Latest revision as of 07:51, 14 July 2024

scientific article
Language Label Description Also known as
English
Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
scientific article

    Statements

    Identifiers

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