TITLE:
Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time
AUTHORS:
Ruzayn Quaddoura
KEYWORDS:
Bipartite Graphs, Decomposition of Graphs, Design and Analysis of Algorithms, Matching
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.6 No.1,
January
26,
2016
ABSTRACT: The
bipartite Star123-free
graphs were introduced by V. Lozin in [1] to generalize some already known classes of
bipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L.
Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in
bipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s
conjecture.