Partitioning vertices of 1-tough graphs into paths

  • Authors:

  • Cristina Bazgan;Amel Harkat-Benhamdine;Hao Li;Mariusz Wózniakb

  • Affiliations:

  • Univ. Paris-Sud, Orsay, France;Univ. Paris-Sud, Orsay, France;Univ. Paris-Sud, Orsay, France;Faculty of Applied Mathematics, Kraków, Poland

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2001

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper we prove that every 1-tough graph has a partition of its vertices into paths of length at least two.