A neighborhood condition for graphs to have restricted fractional (g,f)-factors
From MaRDI portal
Publication:4986280
DOI10.11575/cdm.v16i1.68085zbMath1458.05222OpenAlexW3158777853MaRDI QIDQ4986280
Publication date: 27 April 2021
Full work available at URL: https://cdm.ucalgary.ca/article/download/68085/54775
Related Items (2)
Path factors and neighborhoods of independent sets in graphs ⋮ Some sufficient conditions for path-factor uniform graphs
Cites Work
- Unnamed Item
- A note on the existence of fractional \(f\)-factors in random graphs
- Graph factors and factorization: 1985--2003: a survey
- A sufficient condition for a graph to have \([a,b\)-factors]
- Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
- Some results on path-factor critical avoidable graphs
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Subgraphs with orthogonal factorizations in graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A toughness condition for fractional \((k,m)\)-deleted graphs
- Toughness, binding number and restricted matching extension in a graph
- A degree condition for a graph to have \((a,b)\)-parity factors
- New isolated toughness condition for fractional $(g,f,n)$-critical graphs
This page was built for publication: A neighborhood condition for graphs to have restricted fractional (g,f)-factors
