A neighborhood condition for graphs to have restricted fractional (g,f)-factors
From MaRDI portal
Publication:4986280
DOI10.11575/CDM.V16I1.68085zbMATH Open1458.05222OpenAlexW3158777853MaRDI QIDQ4986280FDOQ4986280
Authors: Sizhong Zhou, Zhiren Sun 
Publication date: 27 April 2021
Full work available at URL: https://cdm.ucalgary.ca/article/download/68085/54775
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
- Graph factors and factorization: 1985--2003: a survey
- Title not available (Why is that?)
- A note on the existence of fractional \(f\)-factors in random graphs
- A sufficient condition for a graph to have \([a,b]\)-factors
- Subgraphs with orthogonal factorizations in graphs
- Two tight independent set conditions for fractional \((g,f,m)\)-deleted graphs systems
- A degree condition for fractional \((g, f, n)\)-critical covered graphs
- Degree conditions for fractional \((a,b,k)\)-critical covered graphs
- A degree condition for a graph to have \((a,b)\)-parity factors
- New isolated toughness condition for fractional $(g,f,n)$-critical graphs
- Some results on path-factor critical avoidable 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
- A toughness condition for fractional \((k,m)\)-deleted graphs
- Toughness, binding number and restricted matching extension in a graph
Cited In (5)
- Some sufficient conditions for path-factor uniform graphs
- A neighborhood condition for graphs to have \([a,b]\)-factors excluding a given subgraph
- Path factors and neighborhoods of independent sets in graphs
- Neighbourhood and the existence of fractional \(k\)-factors of graphs
- On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
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)
