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)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Graph factors and factorization: 1985--2003: a survey, \(k\) -factors in regular graphs, \(f\)-factors in bipartite (\(mf\))-graphs, More sufficient conditions for a graph to have factors, Factors and factorizations of graphs—a survey
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