%0 Journal Article
%T Solving the Maximum Matching Problem on Bipartite <i>Star</i><sub>123</sub>-Free Graphs in Linear Time
%A Ruzayn Quaddoura
%J Open Journal of Discrete Mathematics
%P 13-24
%@ 2161-7643
%D 2016
%I Scientific Research Publishing
%R 10.4236/ojdm.2016.61003
%X The
bipartite <i>Star</i><sub>123</sub>-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 <i>Star</i><sub>123</sub>-free graphs a linear time algorithm of J. L.
Fouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in
bipartite <i>Star</i><sub>123</sub>, <i>P</i><sub>7</sub>-free graphs presented in [2]. Our algorithm is a solution of Lozin¡¯s
conjecture.
%K Bipartite Graphs
%K Decomposition of Graphs
%K Design and Analysis of Algorithms
%K Matching
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=63041