The extension degree conditions for fractional factor

DOI10.1007/s10114-020-9156-0zbMath1442.05176arXiv1904.02482OpenAlexW3009896915MaRDI QIDQ1987571

Wei Gao, Juan Luis García Guirao, Wei Fan Wang

Publication date: 15 April 2020

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

Full work available at URL: https://arxiv.org/abs/1904.02482

zbMATH Keywords

independent setdegree conditionfractional factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ Some results about ID-path-factor critical graphs ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Research on fractional critical covered graphs ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An existence theorem on fractional deleted graphs
• Degree conditions for fractional \((g,f,n^\prime,m)\)-critical deleted graphs and fractional ID-\((g,n,f,m)\)-deleted graphs
• 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
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
• Remarks on fractional ID-\(k\)-factor-critical graphs
• Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs
• An independent set degree condition for fractional critical deleted graphs
• A result on \(r\)-orthogonal factorizations in digraphs
• Hamilton-connectivity of interconnection networks modeled by a product of graphs
• Convexity result and trees with large Balaban index
• Remarks on orthogonal factorizations of digraphs
• Some results about component factors in graphs