ON CUTS AND MATCHINGS IN PLANAR GRAPHS

被引：32
|
作者：
BARAHONA, F [1 ]
机构：
[1] UNIV WATERLOO, DEPT COMBINATOR & OPTIMIZAT, WATERLOO N2L 3G1, ONTARIO, CANADA
来源：
MATHEMATICAL PROGRAMMING | 1993年 / 60卷 / 01期
关键词：
CUT POLYTOPE; MATCHING; MULTICOMMODITY FLOWS;
D O I：
10.1007/BF01580600
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the max cut problem in graphs not contractible to K5, and optimum perfect matchings in planar graphs. We prove that both problems can be formulated as polynomial size linear programs.
引用
下载
收藏
页码：53 / 68
页数：16
相关论文
共 50 条
  • [11] Cuts in matchings of 3-connected cubic graphs
    Knauer, Koija
    Valicov, Petru
    EUROPEAN JOURNAL OF COMBINATORICS, 2019, 76 : 27 - 36
  • [12] Extending matchings in planar graphs .5.
    Plummer, MD
    DISCRETE MATHEMATICS, 1996, 150 (1-3) : 315 - 324
  • [13] EXTENDING MATCHINGS IN PLANAR GRAPHS-IV
    PLUMMER, MD
    DISCRETE MATHEMATICS, 1992, 109 (1-3) : 207 - 219
  • [14] Minimal Disconnected Cuts in Planar Graphs
    Kaminski, Marcin
    Paulusma, Daniel
    Stewart, Anthony
    Thilikos, Dimitrios M.
    NETWORKS, 2016, 68 (04) : 250 - 259
  • [15] Kasteleyn cokernels and perfect matchings on planar bipartite graphs
    Taylor, Libby
    JOURNAL OF ALGEBRAIC COMBINATORICS, 2023, 57 (03) : 727 - 737
  • [16] ON THE EXPECTED NUMBER OF PERFECT MATCHINGS IN CUBIC PLANAR GRAPHS
    Noy, Marc
    Requile, Clement
    Rue, Juanjo
    PUBLICACIONS MATEMATIQUES, 2022, 66 (01) : 325 - 353
  • [17] Maximum matchings in planar graphs via Gaussian elimination
    Mucha, M
    Sankowski, P
    ALGORITHMICA, 2006, 45 (01) : 3 - 20
  • [18] Upper bounds for perfect matchings in Pfaffian and planar graphs
    Behmaram, Afshin
    Friedland, Shmuel
    ELECTRONIC JOURNAL OF COMBINATORICS, 2013, 20 (01):
  • [19] Maximum matchings in planar graphs via gaussian elimination
    Marcin Mucha
    Piotr Sankowski
    Algorithmica, 2006, 45 : 3 - 20
  • [20] Kasteleyn cokernels and perfect matchings on planar bipartite graphs
    Libby Taylor
    Journal of Algebraic Combinatorics, 2023, 57 : 727 - 737
12345