Sufficient conditions for a graph to have factors
From MaRDI portal
Publication:803162
DOI10.1016/0012-365X(90)90116-YzbMath0727.05045MaRDI QIDQ803162
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (9)
Factors and factorizations of graphs—a survey ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ The existence of even regular factors of regular graphs on the number of cut edges ⋮ \(f\)-factors in bipartite (\(mf\))-graphs ⋮ The existence of semi-colorings in a graph ⋮ \(k\) -factors in regular graphs ⋮ \(\{k,r-k\}\)-factors of \(r\)-regular graphs ⋮ More sufficient conditions for a graph to have factors ⋮ Regular graph and some vertex-deleted subgraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular factors in nearly regular graphs
- Graph factors
- On defect-d matchings in graphs
- Factors and factorizations of graphs—a survey
- [a,b-factorization of a graph]
- Subgraphs with prescribed valencies
- On factorisation of graphs
- The Factors of Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Sufficient conditions for a graph to have factors
