Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
From MaRDI portal
Publication:2319715
DOI10.1016/J.DISC.2019.05.004zbMath1418.05111OpenAlexW2946451706MaRDI QIDQ2319715
Publication date: 20 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.05.004
Related Items (5)
Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Research on fractional critical covered graphs ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ A sufficient condition for a graph to be fractional \((k,n)\)-critical ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Randomly orthogonal factorizations with constraints in bipartite networks
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- Toughness of graphs and the existence of factors
- Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle]
- A degree condition for a graph to have \((a,b)\)-parity factors
- Simplified existence theorems on all fractional \([a,b\)-factors]
- On all fractional \({(a,b,k)}\)-critical graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Remarks on orthogonal factorizations of digraphs
- Binding numbers for all fractional (a, b, k)-critical graphs
- Independence number, connectivity, and r‐factors
- Independence number, connectivity and fractional (g,f)-factors in graphs
- Some remarks about factors of graphs
This page was built for publication: Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs
