The bipartite Star<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 Star<sub>123</su...The bipartite Star<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 Star<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 Star<sub>123</sub>, P<sub>7</sub>-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.展开更多
文摘The bipartite Star<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 Star<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 Star<sub>123</sub>, P<sub>7</sub>-free graphs presented in [2]. Our algorithm is a solution of Lozin’s conjecture.
