On edge connectivity and parity factor
type: Item
instance of: scholarly article
title: On edge connectivity and parity factor
zbMATH Open document ID: 1327.05184
author: Hongliang Lu
author: Wei Wang
author: Yuqing Lin
publication date: 2015-07-08T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6456753
zbMATH Keywords: edge connectivity
zbMATH Keywords: parity factor
MaRDI profile type: Publication
full work available at URL: s10114-015-4104-0
OpenAlex ID: W2012468424
cites work: Compressed Sensing: How Sharp Is the Restricted Isometry Property?
cites work: Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
cites work: The factorization of graphs. II
cites work: Q3880849
cites work: Graph Factors and Matching Extensions
DOI: 10.1007/S10114-015-4104-0
published in: Acta Mathematica Sinica, English Series
Recommended article: Edge‐tenacious networks
Recommended article: Q4028271
Recommended article: Edge-connectivity augmentation problems
Recommended article: Edge-Connectivity Augmentation with Partition Constraints
Recommended article: Q4250196
Recommended article: Super edge-connectivity and matching preclusion of data center networks
Recommended article: Understanding edge connectivity in the Internet through core decomposition
Recommended article: Local Flow Partitioning for Faster Edge Connectivity
Recommended article: Edge connectivity augmentation in near-linear time
description: scientific article