Some Results of Fractional n-extendable Graphs
Shaohui Zhai · Journal of Xiamen University · 2007
A graph G is called fractional n-extendable if G has a n-matching and each n-matching M of G can be extended to a fractional perfect matching M of G such that f(e)=1 for all e∈M.Ma and Liu firstly introduced the concept and characterized fractional n-extendable graphs and maximally fractional n-extendable graphs.In this paper,the author characterizes fractional n-extendable bipartite graphs and minimally fractional n-extendable graphs,and studies the relation between fractional n-extendablegraphs and k-factor-critical graphs.In addition,the author gives two sufficient conditions of fractional n-extendable graphs in term of binding number and minimum degree respectively.