On edge connectivity and parity factor (Q2353240): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Compressed Sensing: How Sharp Is the Restricted Isometry Property? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The factorization of graphs. II / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3880849 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph Factors and Matching Extensions / rank | |||
Normal rank | |||
Latest revision as of 12:19, 10 July 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
