A degree condition for the existence ofk-factors
From MaRDI portal
Publication:4013416
DOI10.1002/JGT.3190160205zbMATH Open0781.05039OpenAlexW2087522602MaRDI QIDQ4013416FDOQ4013416
Publication date: 27 September 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160205
Recommendations
- A degree condition for the existence of \(k\)-factors with prescribed properties
- scientific article; zbMATH DE number 913257
- Degree sequences and the existence of \(k\)-factors
- scientific article; zbMATH DE number 969172
- A degree condition for the existence of connected \([k, k + 1]\)-factors with prescribed properties
- A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs
- scientific article; zbMATH DE number 1839841
- scientific article; zbMATH DE number 1833096
- A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor
- Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle
Cites Work
Cited In (28)
- Degree sequences and the existence of \(k\)-factors
- Some new sufficient conditions for graphs to have fractionalk-factors
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- A degree condition for graphs having all \((a, b)\)-parity factors
- Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
- A degree condition for a graph to have \((a,b)\)-parity factors
- A degree condition for the existence of \(k\)-factors with prescribed properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On fractional \((f,n)\)-critical graphs
- (k+1)-Cores Have k-Factors
- Eigenvalues and [a,b]‐factors in regular graphs
- Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle
- Title not available (Why is that?)
- Ore‐type condition for the existence of connected factors
- \(k\)-factor and \(l\)-closure in graphs
- The \(A_{\alpha}\)-spectral radius and \([a,b]\)-factors in graphs
- A \([k,k+1]\)-factor containing a given Hamiltonian cycle
- Connected \([k,k+1]\)-factors of graphs
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- Minimum degree, independence number and regular factors
- Graph factors and factorization: 1985--2003: a survey
- Minimum degree of a graph and the existence of k-factors
- Connected \(k\)-factors in bipartite graphs
- Title not available (Why is that?)
- Spectral radius and \([a,b]\)-factors in graphs
This page was built for publication: A degree condition for the existence ofk-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013416)
