\(\{k,r-k\}\)-factors of \(r\)-regular graphs
From MaRDI portal
Publication:742594
DOI10.1007/S00373-013-1324-XzbMath1298.05077OpenAlexW2013120486MaRDI QIDQ742594
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1324-x
Related Items (3)
A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ Regular colorings in regular graphs ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
Cites Work
- Sufficient conditions for a graph to have factors
- Factors of regular graphs
- Sufficient conditions for graphs to have \((g,f)\)-factors
- Factors and factorizations of graphs—a survey
- Regular factors of regular graphs
- A remark on the factor theorems of lovász and tutte
- The Subgraph Problem
- The factorization of graphs. II
- On factorisation of graphs
This page was built for publication: \(\{k,r-k\}\)-factors of \(r\)-regular graphs