Degree conditions for graphs to be fractional k-covered graphs.

zbMATH Open1349.05279MaRDI QIDQ2804751FDOQ2804751

Authors: Sizhong Zhou 

Publication date: 4 May 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

Recommendations

• A degree condition for fractional \([a,b]\)-covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Notes on fractional \((a, b, k)\)-critical covered graphs

zbMATH Keywords

degree conditionfractional \(k\)-factorfractional \(k\)-covered graph

Mathematics Subject Classification ID

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

Cited In (4)

• Neighborhood union conditions for fractional \([a, b]\)-covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• A degree condition for fractional \([a,b]\)-covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

This page was built for publication: Degree conditions for graphs to be fractional \(k\)-covered graphs.

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