Premium
Induced paths in 5‐connected graphs
Author(s) -
Kriesell Matthias
Publication year - 2001
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/1097-0118(200101)36:1<52::aid-jgt5>3.0.co;2-n
Subject(s) - combinatorics , mathematics , path graph , wheel graph , graph , discrete mathematics , graph power , line graph
We show that between any two vertices of a 5‐connected graph there exists an induced path whose vertices can be removed such that the remaining graph is 2‐connected. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 52–58, 2001