An existence theorem on fractional deleted graphs

DOI10.1007/s10998-015-0089-9zbMath1363.05210OpenAlexW940326483MaRDI QIDQ343264

Qiuxiang Bian, Si-zhong Zhou

Publication date: 25 November 2016

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-015-0089-9

zbMATH Keywords

degree condition\((g, f)\)-factorfractional \((g, f)\)-deleted graphfractional \((g, f)\)-factor

Mathematics Subject Classification ID

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

Related Items

Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems, The extension degree conditions for fractional factor, An independent set degree condition for fractional critical deleted graphs

Cites Work

• Unnamed Item
• Binding numbers of fractional \(k\)-deleted graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• On neighborhood condition for graphs to have [\(a\), \(b\)-factors]
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• A degree condition for the existence of \(k\)-factors with prescribed properties
• DEGREE CONDITIONS AND FRACTIONAL k-FACTORS OF GRAPHS
• Subgraphs with prescribed valencies
• The Factors of Graphs