Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors (Q2147605): Difference between revisions
From MaRDI portal
Latest revision as of 10:04, 29 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors |
scientific article |
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
