Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 812067
- On the ascending subgraph decomposition problem for bipartite graphs
- Decomposition of complete bipartite graphs into paths and cycles
- Decomposition of complete bipartite multigraphs into paths and cycles having \(k\) edges
- Decomposition of complete bipartite graphs into paths and stars with same number of edges
Cites work
- A note on path-perfect graphs
- A note on the ascending subgraph decomposition problem
- Decomposition of Bipartite Graphs Into Paths
- Disjoint subsets of integers having a constant sum
- scientific article; zbMATH DE number 4043890 (Why is no real title available?)
- scientific article; zbMATH DE number 4057554 (Why is no real title available?)
- scientific article; zbMATH DE number 3732107 (Why is no real title available?)
- scientific article; zbMATH DE number 3604921 (Why is no real title available?)
- scientific article; zbMATH DE number 3623611 (Why is no real title available?)
- scientific article; zbMATH DE number 554067 (Why is no real title available?)
- scientific article; zbMATH DE number 1109406 (Why is no real title available?)
- scientific article; zbMATH DE number 4122037 (Why is no real title available?)
- scientific article; zbMATH DE number 812067 (Why is no real title available?)
- scientific article; zbMATH DE number 3222646 (Why is no real title available?)
- scientific article; zbMATH DE number 4183456 (Why is no real title available?)
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- On the ascending star subgraphs decomposition of star forests
- On the Problem of Partitioning {1, 2, � , n} into Subsets having Equal Sums
Cited in
(3)
This page was built for publication: Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439309)