Title of article :
Graphs with no M-alternating path between two vertices
Author/Authors :
Dingjun Lou، نويسنده , , Dongning Rao، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
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
Journal title :
Discrete Mathematics
