Article ID Journal Published Year Pages File Type
9514528 Electronic Notes in Discrete Mathematics 2005 7 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
Authors
, ,