Title of article
Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
Author/Authors
Hamburger، نويسنده , , Peter and Cao، نويسنده , , Weiting، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
7
From page
61
To page
67
Abstract
We study two closely related questions. The first addresses when we can decompose the edge set into edge disjoint paths of increasing order where the order grows exactly by one in each step. The second asks for conditions under which a complete bipartite graph decomposes into ascending subgraphs of paths.
Keywords
edge disjoint decomposition , PATH , Complete bipartite graph , Partition
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454087
Link To Document