Operations Research Transactions >
2016 , Vol. 20 >Issue 1: 125 - 130
DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2016.01.013
Some results on fractional k-factor-critical graphs and fractional k-extendable graphs
Received date: 2015-05-28
Online published: 2016-03-15
A simple graph G is said to be fractional k-factor-critical if after deleting any k vertices, the remaining subgraph still has a fractional perfect matching. A graph G is called a fractional k-extendable graph if G has a fractional perfect matching containing M for any k-matching M. In this paper, a sufficient condition for a graph to be fractional k-factor-critical graph and fractional k-extendable graph is given, respectively. Besides, a sufficient and necessary condition for a graph to be fractional k-factor-critical graph is given.
HUANG Xiaoxian, LIU Yan, WU Bosi . Some results on fractional k-factor-critical graphs and fractional k-extendable graphs[J]. Operations Research Transactions, 2016 , 20(1) : 125 -130 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.013
/
| 〈 |
|
〉 |