Premium
Connected, locally 2‐connected, K 1,3 ‐free graphs are panconnected
Author(s) -
Kanetkar S. V.,
Rao P. R.
Publication year - 1984
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.3190080302
Subject(s) - combinatorics , mathematics , vertex connectivity , distance hereditary graph , induced subgraph , vertex (graph theory) , connected component , graph , discrete mathematics , line graph , graph power
A graph G is locally n ‐connected, n ≥ 1, if the subgraph induced by the neighborhood of each vertex is n ‐connected. We prove that every connected, locally 2‐connected graph containing no induced subgraph isomorphic to K 1,3 is panconnected.
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