Title of article
Graphs with no M-alternating path between two vertices
Author/Authors
Dingjun Lou، نويسنده , , Dongning Rao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
4
From page
237
To page
240
Abstract
Let G be a graph with a perfect matching M. In this paper, we prove two theorems to characterize the graph G in which there is no M-alternating path between two vertices x and y in G.
Keywords
n-Extendable graphs , Perfect matching , M-alternating path
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948853
Link To Document