A sufficient condition for a bipartite graph to have a k‐factor
From MaRDI portal
Publication:5749320
Recommendations
- scientific article; zbMATH DE number 1780075
- scientific article; zbMATH DE number 1839841
- A sufficient condition for a graph to have \([a,b]\)-factors
- Two sufficient conditions for a 2-factor in a bipartite graph
- A degree condition of 2-factors in bipartite graphs
- Minimum degree of bipartite graphs and the existence of k-factors
- Sufficient condition for the existence of \(\left[ {a,b} \right]\)-factors in graphs
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- scientific article; zbMATH DE number 1894980
- Connected \(k\)-factors in bipartite graphs
Cited in
(11)- A sufficient condition for a graph to have \([a,b]\)-factors
- Binding numbers and f-factors of graphs
- Connected \(k\)-factors in bipartite graphs
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- Two sufficient conditions for a 2-factor in a bipartite graph
- scientific article; zbMATH DE number 1780075 (Why is no real title available?)
- scientific article; zbMATH DE number 1839841 (Why is no real title available?)
- Generalizations of marriage theorem for degree factors
- Spectral conditions for k-extendability and k-factors of bipartite graphs
- Minimum degree of bipartite graphs and the existence of k-factors
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: A sufficient condition for a bipartite graph to have a k‐factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5749320)
