Let　T　be　a　tree　with　m　edges.　It　was　conjectured　that　every　m-regular　bipartite　graph　can　be　decomposed　into　edge-disjoint　copies　of　T.　In　this　paper,　we　prove　that　every　6-regular　bipartite　graph　can　be　decomposed　into　edge-disjoint　paths　with　6　edges.　As　a　consequence,　every　6-regular　bipartite　graph　on　n　vertices　can　be　decomposed　into　n/2　paths,　which　is　related　to　the　well-known　Gallai＇s　Conjecture:　every　connected　graph　on　n　vertices　can　be　decomposed　into　at　most　n+1/2　paths.