{"title":"Solving the Maximum Matching Problem on Bipartite Star123-Free Graphs in Linear Time","authors":"Ruzayn Quaddoura","doi":"10.4236/OJDM.2016.61003","DOIUrl":null,"url":null,"abstract":"The \nbipartite Star123-free \ngraphs were introduced by V. Lozin in [1] to generalize some already known classes of \nbipartite graphs. In this paper, we extend to bipartite Star123-free graphs a linear time algorithm of J. L. \nFouquet, V. Giakoumakis and J. M. Vanherpe for finding a maximum matching in \nbipartite Star123, P7-free graphs presented in [2]. Our algorithm is a solution of Lozin’s \nconjecture.","PeriodicalId":61712,"journal":{"name":"离散数学期刊(英文)","volume":"41 1","pages":"13-24"},"PeriodicalIF":0.0000,"publicationDate":"2016-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"离散数学期刊(英文)","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.4236/OJDM.2016.61003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.
V. Lozin在2010年引入了二部图Star123-free，推广了一些已知的二部图类。本文将J. L. Fouquet, V. Giakoumakis和J. M. Vanherpe在[2]中提出的寻找二部Star123, P7-free图的最大匹配的线性时间算法推广到二部Star123-free图。我们的算法是Lozin猜想的一个解。
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
