Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors (Q2147605)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sufficient conditions for a graph to have all [a, b]-factors and (a, b)-parity factors |
scientific article; zbMATH DE number 7544767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors |
scientific article; zbMATH DE number 7544767 |
Statements
Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors (English)
0 references
20 June 2022
0 references
all \((a
0 references
b)\)-factors
0 references
\((a
0 references
b)\)-parity factor
0 references
independence number
0 references
connectivity
0 references
0.9073389172554016
0 references
0.8315877318382263
0 references
0.8314232230186462
0 references
