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

zbMATH Open1293.05054MaRDI QIDQ2870965FDOQ2870965

Authors: Jiansheng Cai, Lin Li Edit this on Wikidata

Publication date: 21 January 2014

Published in: Utilitas Mathematica (Search for Journal in Brave)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (10)

• A degree condition for the existence ofk-factors
• A degree condition for the existence of \(k\)-factors with prescribed properties
• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ore‐type condition for the existence of connected factors
• Highly edge-connected factors using given lists on degrees
• A degree condition for \(k\)-uniform graphs
• Degree conditions and fractional \(k\)-factors of graphs

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)