Partitioning vertices of 1-tough graphs into paths

Authors
Bazgan, C Harkat-Benhamdine, A Li, H Wozniak, M
Citation
C. Bazgan et al., Partitioning vertices of 1-tough graphs into paths, THEOR COMP, 263(1-2), 2001, pp. 255-261
Citations number
8
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
263
Issue
1-2
Year of publication
2001
Pages
255 - 261
Database
ISI
SICI code
0304-3975(20010728)263:1-2<255:PVO1GI>2.0.ZU;2-G
Abstract
In this paper we prove that every I-tough graph has a partition of its vert ices into paths of length at least two. (C) 2001 Elsevier Science B.V. All rights reserved.