A degree condition for fractional \((g, f, n)\)-critical covered graphs
From MaRDI portal
Publication:2132837
DOI10.3934/math.2020059zbMath1484.05168OpenAlexW2997092311MaRDI QIDQ2132837
Publication date: 28 April 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2020059
graphdegree conditionfractional \((g, f)\)-factorfractional \((g, f, n)\)-critical covered graphfractional \((g, f)\)-covered graph
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (15)
Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Gödel semantics of fuzzy argumentation frameworks with consistency degrees ⋮ The existence of subdigraphs with orthogonal factorizations in digraphs ⋮ Component factors and binding number conditions in graphs ⋮ A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ Path factors in subgraphs ⋮ 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 ⋮ 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 ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\{k,r-k\}\)-factors of \(r\)-regular graphs
- A degree condition for fractional \([a,b\)-covered graphs]
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- A new degree condition for graphs to have \([a,b\)-factor]
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- Sufficient conditions for graphs to have \((g,f)\)-factors
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Remarks on fractional ID-\(k\)-factor-critical graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A toughness condition for fractional \((k,m)\)-deleted graphs
- A result on \(r\)-orthogonal factorizations in digraphs
- Toughness and the existence of fractional \(k\)-factors of graphs
- Sun toughness and $P_{\geq3}$-factors in graphs
- A degree condition for the existence of regular factors inK1,n-free graphs
- Some results about component factors in graphs
- Some remarks about factors of graphs
This page was built for publication: A degree condition for fractional \((g, f, n)\)-critical covered graphs
