Induced paths in 5-connected graphs

Authors
Kriesell, M
Citation
M. Kriesell, Induced paths in 5-connected graphs, J GRAPH TH, 36(1), 2001, pp. 52-58
Citations number
10
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF GRAPH THEORY
ISSN journal
03649024 → ACNP
Volume
36
Issue
1
Year of publication
2001
Pages
52 - 58
Database
ISI
SICI code
0364-9024(200101)36:1<52:IPI5G>2.0.ZU;2-0
Abstract
We show that between any two vertices of a 5-connected graph there exists a n induced path whose vertices can be removed such that the remaining graph is 2-connected. (C) 2000 John Wiley & Sons, Inc.