A sufficient condition for a graph to be a fractional (f,n)-critical graph
From MaRDI portal
(Redirected from Publication:3564624)
A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph
A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph
Recommendations
Cites work
- Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs
- Fan-type results for the existence of [\(a\),\(b\)]-factors
- Graph theory with applications
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Notes on the binding numbers for (a, b, k)-critical graphs
- On fractional \((f,n)\)-critical graphs
- The stability number and connected \([k,k+1]\)-factor in graphs
- Toughness and the existence of fractional k-factors of graphs
Cited in
(10)- An independent set degree condition for fractional critical deleted graphs
- Degree conditions for graphs to be fractional (a, b, n)-critical graphs
- Some results on fractional n-factor-critical graphs
- A remark about fractional \((f,n)\)-critical graphs
- On fractional (g,f,n)-critical graphs.
- A New Sufficient Condition for a Graph To Be (g, f, n)-Critical
- scientific article; zbMATH DE number 4075124 (Why is no real title available?)
- A neighborhood union condition for fractional (k,n',m)-critical deleted graphs
- An existence theorem on fractional (g, f, n)-critical graphs
- On fractional \((f,n)\)-critical graphs
This page was built for publication: A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564624)
