Gallai's conjecture for disconnected graphs

@article{Dean2000GallaisCF,
  title={Gallai's conjecture for disconnected graphs},
  author={Nathaniel Dean and Mekkia Kouider},
  journal={Discrete Mathematics},
  year={2000},
  volume={213},
  pages={43-54}
}
The path number p(G) of a graph G is the minimum number of paths needed to partition the edge set of G. Gallai conjectured that p(G) b n+1 2 c for every connected graph G of order n. Because of the graph consisting of disjoint triangles, the best one could hope for in the disconnected case is p(G) b 2 3 nc. We prove the sharper result that p(G) 1 2 u + b 2 3 gc where u is the number of odd vertices and g is the number of nonisolated even vertices. 

From This Paper

Topics from this paper.
9 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Path decompositions of regular graphs, Internal report

  • M. Kouider, Z. Lonc
  • LRI n0
  • 1994
1 Excerpt

os' conjecture and small cycle double covers of planar graphs

  • K. Sey arth, Haj
  • Discrete Math
  • 1992

Path partitions and cycle partitions of eulerian graphs of maximum degree 4

  • O. Favaron, M. Kouider
  • Studia Sci. Math. Hungarica
  • 1988

Contractible edges and conjectures about path and cycle num- bers

  • N. Dean
  • Phd thesis,
  • 1987

os' conjecture

  • A. Granville, A. Moisiadis, On Haj
  • Congressus Nu- merantium
  • 1987

What is the smallest number of cycles in a dicycle decomposi- tion of an eulerian digraph

  • N. Dean
  • J. Graph Theory
  • 1986

os' conjecture (in Chinese)

  • T. Jiang, On Haj
  • J. China Univ. Sci. Tech
  • 1984

asz, On covering of graphs, Theory of Graphs (P. Erd} os and G. Ka- tona, eds

  • L. Lov
  • 1968
3 Excerpts

Similar Papers

Loading similar papers…