A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
From MaRDI portal
Publication:1617028
DOI10.1007/s10255-018-0786-2zbMath1402.05119OpenAlexW2895001549MaRDI QIDQ1617028
Publication date: 7 November 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-018-0786-2
graphminimum degreeneighborhoodfractional \([a, b\)-factor]fractional ID-\([a, b\)-factor-critical]
Related Items (8)
Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Component factors and binding number conditions in graphs ⋮ A note on fractional ID-\( [ a , b \)-factor-critical covered graphs] ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs]
- Sufficient condition for the existence of an even \([a,b\)-factor in graph]
- Factors and factorizations of graphs. Proof techniques in factor theory
- Degree conditions of fractional ID-\(k\)-factor-critical graphs
- The existence of \(k\)-factors in squares of graphs
- Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b\)-factor]
- Simplified existence theorems on all fractional \([a,b\)-factors]
- Ore‐type condition for the existence of connected factors
- Fractional \((g,f)\)-factors of graphs
This page was built for publication: A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
