A lower bound on the number of removable ears of 1-extendable graphs (Q966053): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3424771 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ear decompositions of matching covered graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching structure and the matching lattice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On n-extendable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5319150 / rank | |||
Normal rank |
Latest revision as of 18:19, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound on the number of removable ears of 1-extendable graphs |
scientific article |
Statements
A lower bound on the number of removable ears of 1-extendable graphs (English)
0 references
27 April 2010
0 references
1-extendable graphs
0 references
removable ear
0 references
excessive index
0 references