The minimum size of a k-connected locally nonforesty graph of order n is determined exactly for k=4, k=2 and k=1, and equals ceil(kn/2) for k at least 5.
West, Research problems, Discrete Math., 272(2003), 301 -306
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The minimum size of a $k$-connected locally nonforesty graph
The minimum size of a k-connected locally nonforesty graph of order n is determined exactly for k=4, k=2 and k=1, and equals ceil(kn/2) for k at least 5.