More sufficient conditions for a graph to have factors (Q1584225): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simplified existence theorems for \((g,f)\)-factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular factors in nearly regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sufficient conditions for a graph to have factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank |
Revision as of 17:03, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | More sufficient conditions for a graph to have factors |
scientific article |
Statements
More sufficient conditions for a graph to have factors (English)
0 references
2 November 2000
0 references
factors
0 references
degree constrained subgraphs
0 references
fractional subgraphs
0 references