An Ore-type condition for the existence of \(k\)-factors in graphs (Q1180675): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3818315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Binding numbers and \(f\)-factors of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum degree of a graph and the existence of k-factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Independence number, connectivity, and r‐factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factors of Graphs / rank | |||
Normal rank |
Revision as of 13:08, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An Ore-type condition for the existence of \(k\)-factors in graphs |
scientific article |
Statements
An Ore-type condition for the existence of \(k\)-factors in graphs (English)
0 references
27 June 1992
0 references
Ore-type condition
0 references
\(k\)-factor
0 references
degree sum
0 references