On all fractional \({(a,b,k)}\)-critical graphs
From MaRDI portal
Publication:2452417
DOI10.1007/s10114-014-2629-2zbMath1288.05208OpenAlexW2026124286MaRDI QIDQ2452417
Publication date: 3 June 2014
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-014-2629-2
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 (7)
Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems ⋮ A degree condition for fractional \([a,b\)-covered graphs] ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
Cites Work
- Unnamed Item
- A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
- Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor]
- 2-factors and independent sets on claw-free graphs
- A characterization of graphs having all \((g,f)\)-factors
- A neighbourhood condition for graphs to have \([a,b\)-factors]
- Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
- On neighborhood condition for graphs to have [\(a\), \(b\)-factors]
- Simplified existence theorems on all fractional \([a,b\)-factors]
- Maximum fractional factors in graphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Some remarks about factors of graphs
- Some new sufficient conditions for graphs to have fractionalk-factors
This page was built for publication: On all fractional \({(a,b,k)}\)-critical graphs
