Remarks on fractional ID-\(k\)-factor-critical graphs

DOI10.1007/S10255-019-0818-6zbMath1416.05238OpenAlexW2945604472MaRDI QIDQ2316312

Lan Xu, Zurun Xu, Si-zhong Zhou

Publication date: 26 July 2019

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

Full work available at URL: https://doi.org/10.1007/s10255-019-0818-6

zbMATH Keywords

minimum degreeneighborhoodfractional \(k\)-factorfractional ID-\(k\)-factor-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07) Fractional graph theory, fuzzy graph theory (05C72)

Related Items (9)

A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Research on fractional critical covered graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ The extension degree conditions for fractional factor ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ Parameters and fractional factors in different settings

Cites Work

• Unnamed Item
• A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• Degree conditions of fractional ID-\(k\)-factor-critical graphs
• The existence of \(k\)-factors in squares of graphs
• Some results on fractional \(k\)-factors
• Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
• Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
• A toughness condition for fractional \((k,m)\)-deleted graphs
• Maximum fractional factors in graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Remarks on orthogonal factorizations of digraphs
• A sufficient condition for a graph to be an (a, b, k)-critical graph
• k -Factors and Neighbourhoods of Independent Sets in Graphs
• Some results about component factors in graphs
• Fractional \((g,f)\)-factors of graphs

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