INDUCED MATCHINGS IN BIPARTITE GRAPHS

被引：73
|
作者：
FAUDREE, RJ [1 ]
GYARFAS, A [1 ]
SCHELP, RH [1 ]
TUZA, Z [1 ]
机构：
[1] HUNGARIAN ACAD SCI,INST COMP & AUTOMAT,H-1361 BUDAPEST 5,HUNGARY
来源：
DISCRETE MATHEMATICS | 1989年 / 78卷 / 1-2期
关键词：
D O I：
10.1016/0012-365X(89)90163-5
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：83 / 87
页数：5
相关论文
共 50 条
  • [41] Semi-matchings for bipartite graphs and load balancing
    Harvey, NJA
    Ladner, RE
    Lovász, L
    Tarnir, T
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2006, 59 (01): : 53 - 78
  • [42] Almost fair perfect matchings in complete bipartite graphs
    Othman, Abeer
    Berger, Eli
    [J]. DISCRETE MATHEMATICS, 2024, 347 (04)
  • [43] Matchings in node-weighted convex bipartite graphs
    Katriel, Irit
    [J]. INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 205 - 211
  • [44] Z-transformation graphs of maximum matchings of plane bipartite graphs
    Zhang, HP
    Zha, RJ
    Yao, HY
    [J]. DISCRETE APPLIED MATHEMATICS, 2004, 134 (1-3) : 339 - 350
  • [45] ON THE INVERSE OF A CLASS OF BIPARTITE GRAPHS WITH UNIQUE PERFECT MATCHINGS
    Panda, S. K.
    Pati, S.
    [J]. ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2015, 29 : 89 - 101
  • [46] The Combinatorial Nullstellensatz and DFT on Perfect Matchings in Bipartite Graphs
    Brauch, Timothy M.
    Kezdy, Andre E.
    Snevily, Hunter S.
    [J]. ARS COMBINATORIA, 2014, 114 : 461 - 475
  • [47] Dynamic Matchings in Left Weighted Convex Bipartite Graphs
    Zu, Quan
    Zhang, Miaomiao
    Yu, Bin
    [J]. FRONTIERS IN ALGORITHMICS, FAW 2014, 2014, 8497 : 330 - 342
  • [48] Kasteleyn cokernels and perfect matchings on planar bipartite graphs
    Libby Taylor
    [J]. Journal of Algebraic Combinatorics, 2023, 57 : 727 - 737
  • [49] APPLICATION OF RADO THEOREM TO DISJOINT MATCHINGS IN BIPARTITE GRAPHS
    MURTY, USR
    [J]. JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1978, 17 (APR): : 193 - 194
  • [50] Counting matchings in irregular bipartite graphs and random lifts
    Lelarge, M.
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2230 - 2237
12345