\(k\) -factors in regular graphs

DOI10.1007/s10114-007-6555-4zbMath1155.05054MaRDI QIDQ943560

Wai Chee Shiu, Gui Zhen Liu

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

zbMATH Keywords

regular graph; edge-connectivity; k-factor

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C40: Connectivity

Related Items

Labelings of plane graphs containing Hamilton path, On the restricted arc-connectivity of \(s\)-geodetic digraphs, 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, Symmetry and transitive properties of monohedral \(f\)-triangulations of the Riemannian sphere, Strong labelings of linear forests

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item