Minimum size of n-factor-critical graphs and k-extendable graphs

Zanbo Zhang; Xiaoyan Zhang; Dingjun Lou; Xuelian Wen

Minimum size of n-factor-critical graphs and k-extendable graphs

Combinatorics 2017-07-25 v1

Authors: Zanbo Zhang , Xiaoyan Zhang , Dingjun Lou , Xuelian Wen

Abstract

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$ .

Keywords

bipartite graphs graph theory

Cite

@article{arxiv.1707.07288,
  title  = {Minimum size of n-factor-critical graphs and k-extendable graphs},
  author = {Zanbo Zhang and Xiaoyan Zhang and Dingjun Lou and Xuelian Wen},
  journal= {arXiv preprint arXiv:1707.07288},
  year   = {2017}
}

Comments

13 pages, 8 figures, published in Graphs and Combinatorics

Related papers

View all related →