Title of article
The graphs with maximum induced matching and maximum matching the same size Original Research Article
Author/Authors
Kathie Cameron، نويسنده , , Tracy Walker، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
7
From page
49
To page
55
Abstract
Kobler and Rotics gave a polytime algorithm for deciding if a graph has maximum induced matching and maximum matching the same size, and for finding a maximum induced matching in a graph where equality holds. We give a simple characterization of these graphs. Our characterization provides a simpler recognition algorithm.
Keywords
Perfect graph , optimization problems , Matroid , Matching , Induced matching
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948402
Link To Document