On edge connectivity and parity factor (Q2353240): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10114-015-4104-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2012468424 / rank | |||
Normal rank | |||
Revision as of 21:28, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On edge connectivity and parity factor |
scientific article |
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
