Decomposition of bipartite graphs under degree constraints
From MaRDI portal
Publication:5287449
Recommendations
Cites work
Cited in
(11)- Decompositions of regular bipartite graphs
- Bidegree of graph and degeneracy number
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
- Decomposing a graph into two subgraphs with prescribed parities of vertex degrees
- On canonical decomposition of bipartite graphs
- Balanced network flows. IV: Duality and structure theory.
- scientific article; zbMATH DE number 4014756 (Why is no real title available?)
- On decomposition of triangle-free graphs under degree constraints
- scientific article; zbMATH DE number 944226 (Why is no real title available?)
- Bipartite graphs totally decomposable by canonical decomposition
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Decomposition of bipartite graphs under degree constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287449)