Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs

DOI10.1007/s00010-012-0121-6zbMath1254.05161OpenAlexW2090565463MaRDI QIDQ1759591

Lan Xu, Si-zhong Zhou, Zhi-ren Sun

Publication date: 21 November 2012

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00010-012-0121-6

zbMATH Keywords

independence numberminimum degreefractional \(k\)-factorfractional ID-\(k\)-factor-critical graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs] ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]

Cites Work

• Unnamed Item
• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• The existence of even regular factors of regular graphs on the number of cut edges
• Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor]
• Degree conditions of fractional ID-\(k\)-factor-critical graphs
• The existence of \(k\)-factors in squares of graphs
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Independent-set-deletable factor-critical power graphs
• Maximum fractional factors in graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Some new sufficient conditions for graphs to have fractionalk-factors
• Notes on the binding numbers for (a, b, k)-critical graphs
• Fractional \((g,f)\)-factors of graphs

This page was built for publication: Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs