Title of article
Onk-Critical Connected Line Graphs
Author/Authors
Kriesell، نويسنده , , Matthias، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
7
From page
1
To page
7
Abstract
We show that any line graph contains a set of three vertices which is not included in a smallest separating vertex set. This was conjectured by Maurer and Slater.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1998
Journal title
Journal of Combinatorial Theory Series B
Record number
1526386
Link To Document