Title of article
A note on a conjecture on maximum matching in almost regular graphs
Author/Authors
Picouleau، نويسنده , , C.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
2
From page
3646
To page
3647
Abstract
Mkrtchyan, Petrosyan, and Vardanyan made the following conjecture: Every graph G with Δ ( G ) − δ ( G ) ≤ 1 has a maximum matching whose unsaturated vertices do not have a common neighbor. We disprove this conjecture.
Keywords
Matching , regular graph , bipartite graph
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599538
Link To Document