On a matroid defined by ear-decompositions of graphs (Q1924493): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 14:18, 24 May 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
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
