A sufficient condition for the existence of a k-factor excluding a given r-factor
Let G be a graph, and let k, r be nonnegative integers with k ≥ 2. A k-factor of G is a spanning subgraph F of G such that dF(x) = k for each x ∈ V (G), where dF(x) denotes the degree of x in F. For S ⊆ V (G), NG(S) = ∪x∊SNG(x). The binding number of G is defined by bind(G)=min{|NG(S)||S|:∅≠S⊂V(G),N...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2017-01-01
|
| Series: | Applied Mathematics and Nonlinear Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.21042/AMNS.2017.1.00002 |