On a matroid defined by ear-decompositions of graphs (Q1924493): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q185366
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Martin Loebl / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative weightings and ear-decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234158 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01844849 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023971701 / rank
 
Normal rank

Latest revision as of 08:46, 30 July 2024

scientific article
Language Label Description Also known as
English
On a matroid defined by ear-decompositions of graphs
scientific article

    Statements

    On a matroid defined by ear-decompositions of graphs (English)
    0 references
    0 references
    11 March 1997
    0 references
    It is proved that the minimal critical-making edge-sets form the bases of a matroid.
    0 references
    ear-decompositions
    0 references
    matroid
    0 references
    0 references

    Identifiers

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