Minimal path decomposition of complete bipartite graphs
From MaRDI portal
Publication:1743479
DOI10.1007/s10878-017-0200-7zbMath1395.90211OpenAlexW2770382082MaRDI QIDQ1743479
Costas K. Constantinou, Georgios Ellinas
Publication date: 13 April 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/1319388
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Path decomposition of graphs with given path length
- Packing paths in complete graphs
- Edge-decompositions of highly connected graphs into paths
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- Path decompositions and Gallai's conjecture
- A note on edge-decompositions of planar graphs
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Covering the edges of a connected graph by paths
- Gallai's conjecture for disconnected graphs
- Decompositions of highly connected graphs into paths of length 3
- An upper bound for the path number of a graph
- Gallai's Conjecture For Graphs of Girth at Least Four
This page was built for publication: Minimal path decomposition of complete bipartite graphs