A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
From MaRDI portal
Publication:2229576
DOI10.1134/S0032946020040043zbMath1459.05275OpenAlexW3124981905MaRDI QIDQ2229576
Publication date: 18 February 2021
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946020040043
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed systems (68M14) Communication theory (94A05)
Related Items (15)
Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ 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 ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Degree conditions for \(k\)-Hamiltonian \([a,b\)-factors] ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ Some results on path-factor critical avoidable graphs ⋮ On \(P_{\geq 3}\)-factor deleted graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the existence of fractional \(f\)-factors in random graphs
- Graph factors and factorization: 1985--2003: a survey
- Neighborhood conditions and fractional \(k\)-factors
- Neighborhood conditions and \(k\)-factors
- Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
- A generalization of orthogonal factorizations in digraphs
- A degree condition for fractional \([a,b\)-covered 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
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- A toughness condition for fractional \((k, m)\)-deleted graphs revisited
- Remarks on fractional ID-\(k\)-factor-critical 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
- A degree condition for a graph to have \((a,b)\)-parity factors
- Remarks on orthogonal factorizations of digraphs
- Sun toughness and $P_{\geq3}$-factors in graphs
- Remarks on path factors in graphs
- An algorithmic proof of Tutte's f-factor theorem
- Some results about component factors in graphs
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
- Fractional \((g,f)\)-factors of graphs
This page was built for publication: A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
