Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs

作者：Zhang, Zan-Bo; Zhang, Xiaoyan^*; Lou, Dingjun; Wen, Xuelian

来源：Graphs and Combinatorics, 2012, 28(3): 433-448.

DOI：10.1007/s00373-011-1045-y

• k-Extendable
• n-Factor-critical
• Minimum size

We determine the minimum size of n-factor-critical graphs and that of k-extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the minimum size of k-extendable non-bipartite graphs for k = 1, 2, and pose a related conjecture for general k.

• 出版日期2012-5
• 单位南京师范大学; 华南师范大学; 广东轻工职业技术学院; 中山大学