http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
SOME RESULTS ON FRACTIONAL n-FACTOR-CRITICAL GRAPHS
Yu, Jiguo,Bian, Qiuju,Liu, Guizhen,Wang, Na 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.25 No.1
A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.