Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs

DOI10.1007/S10255-018-0773-7zbMath1395.05137OpenAlexW2885242407WikidataQ129383841 ScholiaQ129383841MaRDI QIDQ1782047

Zhi-ren Sun, Si-zhong Zhou

Publication date: 18 September 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-018-0773-7

zbMATH Keywords

neighborhoodfractional \(k\)-factorfractional ID-\(k\)-factor-critical graph

Mathematics Subject Classification ID

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

Related Items (9)

A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs] ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ A degree condition for fractional \([a,b\)-covered graphs] ⋮ The extension degree conditions for fractional factor ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ Parameters and fractional factors in different settings ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted ⋮ Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• 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
• A sufficient condition for a graph to have \([a,b\)-factors]
• Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
• Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
• Independent-set-deletable factor-critical power graphs
• Maximum fractional factors in graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Remarks on orthogonal factorizations of digraphs
• New isolated toughness condition for fractional $(g,f,n)$-critical graphs
• NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS
• Fractional \((g,f)\)-factors of graphs

This page was built for publication: Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs