MATCHINGS IN COUNTABLE GRAPHS

被引：2
|
作者：
STEFFENS, K [1 ]
机构：
[1] TECH UNIV HANOVER,D-3000 HANOVER,FED REP GER
来源：
CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES | 1977年 / 29卷 / 01期
关键词：
D O I：
10.4153/CJM-1977-016-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：165 / 168
页数：4
相关论文
共 50 条
  • [1] The computational strength of matchings in countable graphs
    Flood, Stephen
    Jura, Matthew
    Levin, Oscar
    Markkanen, Tyler
    [J]. ANNALS OF PURE AND APPLIED LOGIC, 2022, 173 (08)
  • [2] MEASURABLE PERFECT MATCHINGS FOR ACYCLIC LOCALLY COUNTABLE BOREL GRAPHS
    Conley, Clinton T.
    Miller, Benjamin D.
    [J]. JOURNAL OF SYMBOLIC LOGIC, 2017, 82 (01) : 258 - 271
  • [3] On matchings in graphs
    Jones, DM
    Roehm, DJ
    Schultz, M
    [J]. ARS COMBINATORIA, 1998, 50 : 65 - 79
  • [4] Mixed matchings in graphs
    Frankl, Peter
    [J]. DISCRETE MATHEMATICS, 2020, 343 (02)
  • [5] Matchings in graphs and groups
    Jarden, Adi
    Levit, Vadim E.
    Shwartz, Robert
    [J]. DISCRETE APPLIED MATHEMATICS, 2018, 247 : 216 - 224
  • [6] COUNTING MATCHINGS IN GRAPHS
    FARRELL, EJ
    [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1987, 324 (03): : 331 - 339
  • [7] MATCHINGS IN REGULAR GRAPHS
    NADDEF, D
    PULLEYBLANK, WR
    [J]. DISCRETE MATHEMATICS, 1981, 34 (03) : 283 - 291
  • [8] Graphs with the fewest matchings
    Lauren Keough
    Andrew J. Radcliffe
    [J]. Combinatorica, 2016, 36 : 703 - 723
  • [9] GRAPHS WITH THE FEWEST MATCHINGS
    Keough, Lauren
    Radcliffe, Andrew J.
    [J]. COMBINATORICA, 2016, 36 (06) : 703 - 723
  • [10] Supereulerian graphs and matchings
    Lai, Hong-Jian
    Yan, Huiya
    [J]. APPLIED MATHEMATICS LETTERS, 2011, 24 (11) : 1867 - 1869
12345