Premium
Connectivity keeping trees in k ‐connected graphs
Author(s) -
Mader W.
Publication year - 2012
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/jgt.20585
Subject(s) - mathematics , combinatorics , chordal graph , discrete mathematics , graph
We show that one can choose the minimum degree of a k ‐connected graph G large enough (independent of the vertex number of G ) such that G contains a copy T of a prescribed tree with the property that G − V ( T ) remains k ‐connected. This was conjectured in [W. Mader, J Graph Theory 65 (2010), 61–69]. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 324–329, 2012
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom