EXTENDING MATCHINGS IN PLANAR GRAPHS-IV

被引：26
|
作者：
PLUMMER, MD
机构：
[1] Department of Mathematics, Vanderbilt University, Nashville
来源：
DISCRETE MATHEMATICS | 1992年 / 109卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(92)90292-N
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The structure of certain non-2-extendable planar graphs is studied first. In particular, 4-connected 5-regular planar graphs which are not 2-extendable are investigated and examples of these are presented. It is then proved that all 5-connected even planar graphs are 2-extendable. Finally, a certain configuration called a generalized butterfly is defined and it is shown that 4-connected maximal planar even graphs which contain no generalized butterfly are 2-extendable.
引用
下载
收藏
页码：207 / 219
页数：13
相关论文
共 50 条
  • [21] Extending colorings of locally planar graphs
    Albertson, MO
    Hutchinson, JP
    JOURNAL OF GRAPH THEORY, 2001, 36 (02) : 105 - 116
  • [22] Kasteleyn cokernels and perfect matchings on planar bipartite graphs
    Libby Taylor
    Journal of Algebraic Combinatorics, 2023, 57 : 727 - 737
  • [23] LOWER BOUNDS ON THE CARDINALITY OF THE MAXIMUM MATCHINGS OF PLANAR GRAPHS
    NISHIZEKI, T
    BAYBARS, I
    DISCRETE MATHEMATICS, 1979, 28 (03) : 255 - 267
  • [24] Matchings in 1-planar graphs with large minimum degree
    Biedl, Therese
    Wittnebel, John
    JOURNAL OF GRAPH THEORY, 2022, 99 (02) : 217 - 230
  • [25] Computing large matchings in planar graphs with fixed minimum degree
    Franke, Robert
    Rutter, Ignaz
    Wagner, Dorothea
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (32) : 4092 - 4099
  • [26] Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
    Franke, Robert
    Rutter, Ignaz
    Wagner, Dorothea
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 872 - 881
  • [27] Extending precolorings of subgraphs of locally planar graphs
    Albertson, MO
    Hutchinson, JP
    EUROPEAN JOURNAL OF COMBINATORICS, 2004, 25 (06) : 863 - 871
  • [28] Maximum matchings in planar graphs via Gaussian elimination (Extended abstract)
    Mucha, M
    Sankowski, P
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 532 - 543
  • [29] On matchings in graphs
    Jones, DM
    Roehm, DJ
    Schultz, M
    ARS COMBINATORIA, 1998, 50 : 65 - 79
  • [30] Mixed matchings in graphs
    Frankl, Peter
    DISCRETE MATHEMATICS, 2020, 343 (02)
12345