Some sufficient conditions for graphs to have (<i>g, f</i>)-factors (Q5297706): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Si-zhong Zhou / rank | |||
Property / author | |||
Property / author: Si-zhong Zhou / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connected \([a,b]\)-factors in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fan-type results for the existence of [\(a\),\(b\)]-factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Subgraphs with prescribed valencies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The dynamics of a prey-dependent consumption model concerning integrated pest management / rank | |||
Normal rank |
Revision as of 12:05, 26 June 2024
scientific article; zbMATH DE number 5170792
Language | Label | Description | Also known as |
---|---|---|---|
English | Some sufficient conditions for graphs to have (<i>g, f</i>)-factors |
scientific article; zbMATH DE number 5170792 |
Statements
Some sufficient conditions for graphs to have (<i>g, f</i>)-factors (English)
0 references
12 July 2007
0 references
\((g,f)\)-factor
0 references
spanning subgraph
0 references