Minimal path decomposition of complete bipartite graphs
type: Item
instance of: scholarly article
title: Minimal path decomposition of complete bipartite graphs
zbMATH Open document ID: 1395.90211
author: Costas K. Constantinou
author: Georgios Ellinas
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
full work available at URL: https://zenodo.org/record/1319388
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6859583
zbMATH Keywords: graphs
zbMATH Keywords: complete bipartite graphs
zbMATH Keywords: decomposition algorithms
zbMATH Keywords: minimal path decomposition
MaRDI profile type: Publication
OpenAlex ID: W2770382082
cites work: Q3514485
cites work: Packing paths in complete graphs
cites work: Gallai's conjecture for disconnected graphs
cites work: An upper bound for the path number of a graph
cites work: Path decompositions and Gallai's conjecture
cites work: A note on edge-decompositions of planar graphs
cites work: Gallai's Conjecture For Graphs of Girth at Least Four
cites work: Q4288120
cites work: Q5539649
cites work: Covering the edges of a connected graph by paths
cites work: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
cites work: Decompositions of highly connected graphs into paths of length 3
cites work: Edge-decompositions of highly connected graphs into paths
cites work: Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
cites work: Path decomposition of graphs with given path length
DOI: 10.1007/S10878-017-0200-7
description: scientific article; zbMATH DE number 6859583