Neighborhood union conditions for fractional [a, b]-covered graphs
From MaRDI portal
Publication:2302016
Recommendations
- Binding numbers for fractional \((a, b, k)\)-critical covered graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- A degree condition for fractional \([a,b]\)-covered graphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- Research on fractional critical covered graphs
Cites work
- scientific article; zbMATH DE number 1117461 (Why is no real title available?)
- scientific article; zbMATH DE number 4116582 (Why is no real title available?)
- A degree condition for a graph to have \((a,b)\)-parity factors
- A neighbourhood condition for graphs to have \([a,b]\)-factors
- A result on \(r\)-orthogonal factorizations in digraphs
- Degree conditions for graphs to be fractional \(k\)-covered graphs.
- Graph theory
- Neighborhood conditions and fractional \(k\)-factors
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- Remarks on orthogonal factorizations of digraphs
- Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
Cited in
(5)- Research on fractional critical covered graphs
- Spectral radius conditions for fractional \([a,b]\)-covered graphs
- A degree condition for fractional \([a,b]\)-covered graphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
This page was built for publication: Neighborhood union conditions for fractional \([a, b]\)-covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302016)
