Loading...
Highly edge-connected factors using given lists on degrees
Akbari, S ; Sharif University of Technology | 2019
305
Viewed
- Type of Document: Article
- DOI: 10.1002/jgt.22373
- Publisher: Wiley-Liss Inc , 2019
- Abstract:
- Let G be a 2k-edge-connected graph with 𝑘 ≥ 0 and let 𝐿(𝑣) ⊆ {𝑘,…, 𝑑𝐺(𝑣)} for every 𝑣 ∈ 𝑉 (𝐺). A spanning subgraph F of G is called an L-factor, if 𝑑𝐹 (𝑣) ∈ 𝐿(𝑣) for every 𝑣 ∈ 𝑉 (𝐺). In this article, we show that if (Formula presented.) for every 𝑣 ∈ 𝑉 (𝐺), then G has a k-edge-connected L-factor. We also show that if 𝑘 ≥ 1 and (Formula presented.) for every 𝑣 ∈ 𝑉 (𝐺), then G has a k-edge-connected L-factor. © 2018 Wiley Periodicals, Inc
- Keywords:
- Connected {i,i+1}-factor ; Connectivity ; K-edge-connected L-factor ; Regular graph ; Geometry ; Connected factor ; Connected graph ; Connected {i,i+1}-factor ; Regular graphs ; Subgraphs ; Graph theory
- Source: Journal of Graph Theory ; Volume 90, Issue 2 , 2019 , Pages 150-159 ; 03649024 (ISSN)
- URL: https://onlinelibrary.wiley.com/doi/abs/10.1002/jgt.22373