Nash-Williams conditions for the existence of all fractional [a,b]-factors

DOI10.1007/S13226-021-00054-3zbMATH Open1473.05251OpenAlexW3172830712MaRDI QIDQ2243085FDOQ2243085

Authors: Zhiren Sun, Sizhong Zhou 

Publication date: 10 November 2021

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-021-00054-3

Recommendations

• The existence of all fractional \([a,b]\)-factors in networks
• scientific article; zbMATH DE number 6902656
• scientific article; zbMATH DE number 7260013
• All fractional \([a,b]\)-factors with prescribed properties.
• Simplified existence theorems on all fractional \([a,b]\)-factors

zbMATH Keywords

minimum degreestability numberall fractional \([a,b\)-factors]fractional \([a,b\)-factor]

Mathematics Subject Classification ID

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

Cites Work

• Simplified existence theorems on all fractional \([a,b]\)-factors
• \(f\)-factors, complete-factors, and component-deleted subgraphs
• Toughness and the existence of fractional \(k\)-factors of graphs
• Sufficient condition for the existence of an even \([a,b]\)-factor in graph
• Graph factors and factorization: 1985--2003: a survey
• Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs
• A degree condition for the existence ofk-factors
• Title not available (Why is that?)
• Remarks on path factors in graphs
• Subgraphs with orthogonal factorizations in graphs
• On all fractional \({(a,b,k)}\)-critical graphs
• A degree condition for fractional \((g, f, n)\)-critical covered graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Some new sufficient conditions for graphs to have fractional \(k\)-factors
• New isolated toughness condition for fractional \((g,f,n)\)-critical graphs
• Research on fractional critical covered graphs
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Path factors in subgraphs
• Isolated toughness and path-factor uniform graphs
• On \(k\)-orthogonal factorizations in networks

Cited In (6)

• All fractional \([a,b]\)-factors with prescribed properties.
• The extension degree conditions for fractional factor
• The existence of all fractional \([a,b]\)-factors in networks
• Title not available (Why is that?)
• Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors
• Simplified existence theorems on all fractional \([a,b]\)-factors

This page was built for publication: Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors

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