Recent Advances in Algorithms and Combinatorics
Contributors: Bruce A. Reed (Editor); Claudia L. Linhares-Sales (Editor)
Publisher: Springer
Published: November 22, 2002
Language: eng
Number of pages: 368
ISBN-13: 9780387954349
First sentence: A set M of edges of a graph G is a matching of G if each vertex of G is incident with at most one edge of M and a perfect, matching of G if each vertex of G is incident with precisely one edge of M.