关于偶匹配可扩图中删去两个点
관우우필배가확도중산거량개점
On Two-Vertex Deletion in Bipartite Matching Extendable Graphs
  • 万方数据
    河南科学 하남과학
    HENAN SCIENCE
    2007年 3期 361-363 ,共3页

    王秀梅%董云达%林诒勋

    왕수매%동운체%림이훈

    匹配%偶匹配%偶匹配可扩 匹配%偶匹配%偶匹配可擴
    필배%우필배%우필배가확
    matching%bipartite matching%bipartite matching extendable
    设G是含有完美匹配的简单图.称G是偶匹配可扩的,如果G中导出子图是偶图的匹配M都可以扩充为G的完美匹配.研究了在偶匹配可扩图中删去两个顶点后该图的性质.这些性质对于偶匹配可扩图的进一步研究会有帮助.
    설G시함유완미필배적간단도.칭G시우필배가확적,여과G중도출자도시우도적필배M도가이확충위G적완미필배.연구료재우필배가확도중산거량개정점후해도적성질.저사성질대우우필배가확도적진일보연구회유방조.
    Let G be a simple graph containing a perfect matching. G is said to be bipartite matching extendable (BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G. In this paper, we present some properties of BM-extendable graphs after deleting two distinct vertices.They will be useful for further study of BM-extendability.
    원문보기 원문다운로드 사이트로이동
저자의 최근 논문