\(k\) -factors in regular graphs
From MaRDI portal
Publication:943560
DOI10.1007/s10114-007-6555-4zbMath1155.05054OpenAlexW2008101479MaRDI QIDQ943560
Publication date: 9 September 2008
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-007-6555-4
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (11)
An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ On the restricted arc-connectivity of \(s\)-geodetic digraphs ⋮ Perfect matchings in highly cyclically connected regular graphs ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ Super \(d\)-antimagic labelings of disconnected plane graphs ⋮ The existence of even regular factors of regular graphs on the number of cut edges ⋮ Topological minors in bipartite graphs ⋮ Labelings of plane graphs containing Hamilton path ⋮ Strong labelings of linear forests ⋮ Unnamed Item ⋮ Symmetry and transitive properties of monohedral \(f\)-triangulations of the Riemannian sphere
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient conditions for a graph to have factors
- Two results on matching extensions with prescribed and proscribed edge sets
- Regular factors in regular graphs
- On 2-factors with prescribed properties in a bipartite graph
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
- Factors and factorizations of graphs—a survey
- Regular factors of regular graphs
- The Factors of Graphs
- A generalization of orthogonal factorizations in graphs
This page was built for publication: \(k\) -factors in regular graphs