
We show that any line graph contains a set of three vertices which is not included in a smallest separating vertex set.
line graph, Connectivity, Computational Theory and Mathematics, connectivity, \(k\)-critical connected, Discrete Mathematics and Combinatorics, Theoretical Computer Science
line graph, Connectivity, Computational Theory and Mathematics, connectivity, \(k\)-critical connected, Discrete Mathematics and Combinatorics, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
