[a,b]-factors containing a given k-regular subgraph

MaRDI QIDQ2915935zbMATH OpenFDO

Authors Siping Tang, Jianxiang Li, Mingke Gao, Xing Hu

Publication date 5 October 2012

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

\([a,b\)-factor]\(k\)-regular graph\(r\)-factordegree condition

Mathematics Subject Classification ID

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

Recommendations

• \(\{k,r-k\}\)-factors of \(r\)-regular graphs
• Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
• Degree condition for the existence of a k-factor containing a given Hamiltonian cycle
• Degree conditions for graphs to have \([a, b\)]-factors containing a given 2-factor
• scientific article; zbMATH DE number 1790881

Cited in

(5)

• \(k\)-factors containing and avoiding specified sets of edges
• (k+1)-Cores Have k-Factors
• Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph
• \(\{k,r-k\}\)-factors of \(r\)-regular graphs
• \(k\)-factors in regular graphs and edge-connectivity

This page was built for publication: \([a,b]\)-factors containing a given \(k\)-regular subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915935)