Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
type: Item
instance of: scholarly article
title: Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
zbMATH Open document ID: 1254.05161
author: Sizhong Zhou
author: Lan Xu
author: Zhiren Sun
published in: Aequationes Mathematicae
publication date: 2012-11-21T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6109259
zbMATH Keywords: independence number
zbMATH Keywords: minimum degree
zbMATH Keywords: fractional \(k\)-factor
zbMATH Keywords: fractional ID-\(k\)-factor-critical graph
MaRDI profile type: Publication
full work available at URL: s00010-012-0121-6
OpenAlex ID: W2090565463
cites work: Independent-set-deletable factor-critical power graphs
cites work: Degree conditions of fractional ID-\(k\)-factor-critical graphs
cites work: The existence of even regular factors of regular graphs on the number of cut edges
cites work: Independence number, connectivity and \((a,b,k)\)-critical graphs
cites work: Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
cites work: Notes on the binding numbers for (a, b, k)-critical graphs
cites work: Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
cites work: The existence of \(k\)-factors in squares of graphs
cites work: Q3428672
cites work: Maximum fractional factors in graphs
cites work: A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
cites work: Some new sufficient conditions for graphs to have fractionalk-factors
cites work: Toughness and the existence of fractional \(k\)-factors of graphs
cites work: Fractional \((g,f)\)-factors of graphs
DOI: 10.1007/S00010-012-0121-6
description: scientific article; zbMATH DE number 6109259