scientific article; zbMATH DE number 1894980
From MaRDI portal
Publication:4802008
Recommendations
- scientific article; zbMATH DE number 1117461
- Degree conditions for graphs to have \([a, b\)]-factors containing a given 2-factor
- A degree condition for graphs to have \((g,f)\)-factors.
- scientific article; zbMATH DE number 1790881
- A new degree condition for graphs to have \([a,b]\)-factor
- A degree condition for a graph to have \((a,b)\)-parity factors
- A sufficient condition for a graph to have \([a,b]\)-factors
- Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
- A degree condition for graphs to have connected \((g,f)\)-factors
- A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs
Cited in
(9)- Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor
- More sufficient conditions for a graph to have factors
- A new degree condition for graphs to have \([a,b]\)-factor
- On neighborhood condition for graphs to have [\(a\), \(b\)]-factors
- Regular factors in 2-connected \(K_{1,n}\)-free graphs
- A sufficient condition for a bipartite graph to have a k‐factor
- The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity
- The degree conditions for graphs to be \([a,b; n]\)-uniform graphs
- scientific article; zbMATH DE number 969172 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4802008)
