A degree condition for k-uniform graphs

zbMATH Open1278.05185MaRDI QIDQ2839736FDOQ2839736

Authors: Jiansheng Cai 

Publication date: 12 July 2013

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Recommendations

• An independent number condition for the existence of \(k\)-uniform graphs
• A degree condition for the existence of connected \([k, k + 1]\)-factors with prescribed properties
• A degree condition for the existence ofk-factors
• Some sufficient conditions on \( (g, f)\)-\(k\)-uniform graphs
• A degree condition for the existence of \(k\)-factors with prescribed properties

zbMATH Keywords

degree conditionprescribed propertiesconnected \([k,k+1\)-factor]

Mathematics Subject Classification ID

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

Cited In (7)

• A Fan-type degree condition for \(k\)-linked graphs
• Title not available (Why is that?)
• Uniformly connected graphs -- a survey
• An independent number condition for the existence of \(k\)-uniform graphs
• Uniformly connected graphs.
• Degree condition for subdivisions of unicyclic graphs
• Title not available (Why is that?)

This page was built for publication: A degree condition for \(k\)-uniform graphs

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