A neighborhood condition for graphs to have restricted fractional (g,f)-factors
From MaRDI portal
Publication:4986280
Recommendations
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- Neighbourhood and the existence of fractional \(k\)-factors of graphs
- On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
- A result on restricted fractional \((g,f)\)-factors in graphs
- A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
- scientific article; zbMATH DE number 5221493
- A neighborhood condition for graphs to have \((g,f)\)-factors.
- Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- A neighbourhood condition for graphs to have \([a,b]\)-factors
Cites work
- scientific article; zbMATH DE number 874216 (Why is no real title available?)
- A degree condition for a graph to have \((a,b)\)-parity factors
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- A note on the existence of fractional \(f\)-factors in random graphs
- A sufficient condition for a graph to have \([a,b]\)-factors
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- A toughness condition for fractional \((k,m)\)-deleted 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
- Graph factors and factorization: 1985--2003: a survey
- New isolated toughness condition for fractional \((g,f,n)\)-critical graphs
- Research on fractional critical covered graphs
- Some results on path-factor critical avoidable graphs
- Subgraphs with orthogonal factorizations in graphs
- Toughness, binding number and restricted matching extension in a graph
- Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
Cited in
(10)- Path factors and neighborhoods of independent sets in graphs
- Some sufficient conditions for path-factor uniform graphs
- Remarks on restricted fractional \((g, f)\)-factors in graphs
- On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
- A result on restricted fractional \((g,f)\)-factors in graphs
- Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
- A Fan-type result for the existence of restricted fractional \((g, f)\)-factors
- A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph
- Neighbourhood and the existence of fractional \(k\)-factors of graphs
This page was built for publication: A neighborhood condition for graphs to have restricted fractional (g,f)-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986280)
