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 条
  • [1] Matchings in graphs with a given number of cuts
    Liu, Jinfeng
    Huang, Fei
    Wagner, Stephan
    DISCRETE APPLIED MATHEMATICS, 2020, 283 : 473 - 481
  • [2] Matchings in bipartite graphs with a given number of cuts
    Liu, Jinfeng
    Huang, Fei
    DISCRETE APPLIED MATHEMATICS, 2024, 359 : 303 - 309
  • [3] INDUCED MATCHINGS IN SUBCUBIC PLANAR GRAPHS
    Kang, Ross J.
    Mnich, Matthias
    Muller, Tobias
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 1383 - 1411
  • [4] Rainbow number of matchings in planar graphs
    Jin, Zemin
    Ye, Kun
    DISCRETE MATHEMATICS, 2018, 341 (10) : 2846 - 2858
  • [5] Perfect matchings in planar cubic graphs
    Maria Chudnovsky
    Paul Seymour
    Combinatorica, 2012, 32 : 403 - 424
  • [6] Perfect matchings in planar cubic graphs
    Chudnovsky, Maria
    Seymour, Paul
    COMBINATORICA, 2012, 32 (04) : 403 - 424
  • [7] Induced Matchings in Subcubic Planar Graphs
    Kang, Ross J.
    Mnich, Matthias
    Mueller, Tobias
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 112 - +
  • [8] Extending matchings in planar graphs V
    Plummer, M.D.
    Discrete Mathematics, 1996, 150 (1-3):
  • [9] Extending matchings in planar odd graphs
    Zhai, Shaohui
    Guo, Xiaofeng
    ARS COMBINATORIA, 2015, 121 : 81 - 88
  • [10] DISTANCES AND CUTS IN PLANAR GRAPHS
    SCHRIJVER, A
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1989, 46 (01) : 46 - 57
12345