Spanning cycles in regular matroids without small cocircuits (Q449202): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2012.03.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055114693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spanning subgraphs of eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supereulerian graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional arboricity, strength, and principal partitions in graphs and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without spanning closed trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lehmans switching game and a theorem of Tutte and Nash-Williams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large circuits in binary matroids of large cogirth. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Sub-Eulerian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical Point-Arboritic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graphs spanned by Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Latest revision as of 16:55, 5 July 2024

scientific article
Language Label Description Also known as
English
Spanning cycles in regular matroids without small cocircuits
scientific article

    Statements

    Spanning cycles in regular matroids without small cocircuits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2012
    0 references
    0 references
    connected simple regular matroid
    0 references
    0 references