Title of article
A Connectivity Lemma
Author/Authors
Naatz، نويسنده , , Michael، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
4
From page
247
To page
250
Abstract
The purpose of this note is to show how a lemma that is implicit in the work of Barnette can be used for proving lower bounds on the connectivity of certain graphs. The main result is that connectivity equals minimal degree in basic word graphs of antimatroids. This was known before only for the special case of graphs of linear extensions, and the proof was much more complicated.
Keywords
connectivity , Antimatroid , basic word , Balinskiיs Theorem
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2000
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452878
Link To Document