Toughness for fractional \((2, b, k)\)-critical covered graphs
From MaRDI portal
Publication:2687688
DOI10.1007/s40305-021-00359-4OpenAlexW3185703026MaRDI QIDQ2687688
Publication date: 7 March 2023
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-021-00359-4
graphtoughnessfractional \([a, b\)-factor]fractional \([a, b\)-covered graph]fractional \((a, b, k)\)-critical
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Operations research and management science (90B99)
Related Items
Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs
Cites Work
- Unnamed Item
- Unnamed Item
- \(f\)-factors, complete-factors, and component-deleted subgraphs
- General fractional \(f\)-factor numbers of graphs
- Characterizations of maximum fractional \((g,f)\)-factors of graphs
- Toughness of graphs and \([2,b\)-factors]
- Neighborhood conditions and \(k\)-factors
- Toughness and the existence of \(k\)-factors. IV
- A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs]
- Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
- A generalization of orthogonal factorizations in digraphs
- A degree condition for fractional \([a,b\)-covered graphs]
- Toughness of graphs and the existence of factors
- Sufficient conditions for graphs to have \((g,f)\)-factors
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- Some results on path-factor critical avoidable graphs
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Some existence theorems on path factors with given properties in graphs
- Subgraphs with orthogonal factorizations in 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
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A toughness condition for fractional \((k,m)\)-deleted graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Tough graphs and Hamiltonian circuits.
- Ore-type conditions for the existence of even \([2,b\)-factors in graphs]
- Remarks on path factors in graphs
- Toughness and the existence ofk-factors
- Some results about component factors in graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
