Generalization of matching extensions in graphs. II. (Q2370426): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0609756 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3258698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On k-factor-critical graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extendability and factor-criticality / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalization of matching extensions in graphs / 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: Q5287862 / rank | |||
Normal rank |
Latest revision as of 10:35, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalization of matching extensions in graphs. II. |
scientific article |
Statements
Generalization of matching extensions in graphs. II. (English)
0 references
26 June 2007
0 references
\((n, k, d)\)-graphs
0 references
\(k\)-extendability
0 references
\(n\)-factor-criticality
0 references