On edge connectivity and parity factor (Q2353240)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6456753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On edge connectivity and parity factor |
scientific article; zbMATH DE number 6456753 |
Statements
On edge connectivity and parity factor (English)
0 references
8 July 2015
0 references
This paper considers some sufficient conditions for a graph to have an even and even factor with restricted minimum degree and edge connectivity. In particular, the authors prove that every \(n\)-edge-connected graph with minimum degree at least \(n+1\) contains an even factor with minimum degree at least \(n\), and very \((m+1)\)-edge-connected graph contains an odd factor with minimum degree at least m, where n is even and m is odd. The results are shown to be best possible.
0 references
edge connectivity
0 references
parity factor
0 references
0.79608476
0 references
0.7933941
0 references
0.7932736
0 references
0.7918041
0 references
0.7862224
0 references
0.7862224
0 references
0.78439546
0 references
