A degree condition for the existence of connected [k, k + 1]-factors with prescribed properties

MaRDI QIDQ2870965zbMATH OpenFDO

Authors Jiansheng Cai, Lin Li

Publication date 21 January 2014

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

\(k\)-factor\(k\)-factor with prescribed propertiesconnected \([k, k + 1\)-factor]degree conditionuniform graph

Mathematics Subject Classification ID

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

Recommendations

• A degree condition for the existence of \(k\)-factors with prescribed properties
• scientific article; zbMATH DE number 2077646
• A degree condition for the existence ofk-factors
• scientific article; zbMATH DE number 913257
• Degree conditions and fractional k-factors of graphs

Cited in

(12)

• A degree condition for the existence of 1-factors in graphs or their complements
• Connected \([k,k+1]\)-factors of graphs
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
• A degree condition for the existence of \(k\)-factors with prescribed properties
• A degree condition for k-uniform graphs
• Degree conditions and fractional k-factors of graphs
• A degree condition for the existence ofk-factors
• scientific article; zbMATH DE number 2077646 (Why is no real title available?)
• scientific article; zbMATH DE number 913257 (Why is no real title available?)
• Highly edge-connected factors using given lists on degrees
• scientific article; zbMATH DE number 969172 (Why is no real title available?)
• Ore‐type condition for the existence of connected factors

This page was built for publication: A degree condition for the existence of connected \([k, k + 1]\)-factors with prescribed properties

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