A neighborhood union condition for fractional ID-[a, b]-factor-critical graphs

DOI10.1007/S10255-018-0786-2MaRDI QIDQ1617028zbMATH OpenOpenAlexFDO

Authors Yuan Yuan, Rong-Xia Hao

Publication date 7 November 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-0786-2

zbMATH Keywords

fractional \([a, b\)-factor]fractional ID-\([a, b\)-factor-critical]graphminimum degreeneighborhood

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• A result on fractional ID-\([a,b]\)-factor-critical graphs
• A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical

Cites work

• A degree condition for the existence of connected \([k, k + 1]\)-factors with prescribed properties
• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
• Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
• Degree conditions of fractional ID-k-factor-critical graphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• Fractional (g,f)-factors of graphs
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• scientific article; zbMATH DE number 1833096 (Why is no real title available?)
• Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
• Neighborhood conditions for fractional ID-k-factor-critical graphs
• Ore‐type condition for the existence of connected factors
• Simplified existence theorems on all fractional \([a,b]\)-factors
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• The existence of k-factors in squares of graphs

Cited in

(12)

• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• Discussion on fractional (a, b, k)-critical covered graphs
• Component factors and binding number conditions in graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Toughness for fractional \((2, b, k)\)-critical covered graphs
• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• A neighborhood union condition for fractional (k,n',m)-critical deleted graphs
• Spectral radius, the matching number and fractional criticality of graphs

This page was built for publication: A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs

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