Title of article :
On matroid connectivity
Author/Authors :
James Oxley، نويسنده , , Bing Wei and Haidong Wu، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Pages :
4
From page :
321
To page :
324
Abstract :
If M is a loopless matroid in which M/vbX and M/vbY are connected and X∩Y is non-empty, then one easily shows that M/vb(X∪Y) is connected. Likewise, it is straightforward to show that if G and H are n-connected graphs having at least n common vertices, then G ∪ H is n-connected. The purpose of this note is to prove a matroid connectivity result that is a common generalization of these two observations.
Journal title :
Discrete Mathematics
Serial Year :
1995
Journal title :
Discrete Mathematics
Record number :
946211
Link To Document :
بازگشت