Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
From MaRDI portal
Publication:3439309
DOI10.1016/j.endm.2005.06.011zbMath1182.05097MaRDI QIDQ3439309
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.011
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On the ascending subgraph decomposition problem for bipartite graphs, On star forest ascending subgraph decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the ascending subgraph decomposition problem
- Disjoint subsets of integers having a constant sum
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- A note on path-perfect graphs
- On the ascending star subgraphs decomposition of star forests
- Decomposition of Bipartite Graphs Into Paths
- [https://portal.mardi4nfdi.de/wiki/Publication:4189308 On the Problem of Partitioning {1, 2, � , n} into Subsets having Equal Sums]