On Path Decomposition Conjecture of Tibor Gallai

Details On Path Decomposition Conjecture of Tibor Gallai On Path Decomposition Conjecture of Tibor Gallai

2011-06-02

arxiv.org/abs/1106.0642v1

Mathematics

General Mathematics

23 pages

Scientific paper

We settle the Path Decomposition Conjecture (P.D.C.) due to Tibor Gallai for minimally connected graphs, i.e. trees. We use this validity for trees and settle the P. D. C. using induction on the number of edges for all connected graphs. We then obtain a new bound for the number of paths in a path cover in terms of the number of edges using idea of associating a tree with a connected graph. We then make use of a spanning tree in the given connected graph and its associated basic path cover to settle the conjecture of Tibor Gallai in an alternative way. Finally, we show the existence of Hamiltonian path cover satisfying Gallai bound for complete graphs of even order and discuss some of its possible ramifications.

Affiliated with

Also associated with

No associations

Rating

On Path Decomposition Conjecture of Tibor Gallai does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Path Decomposition Conjecture of Tibor Gallai, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Path Decomposition Conjecture of Tibor Gallai will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495654