|
|||||
|
|
Some results on fractionaln-factor-critical graphs |
|
| Authors: | Jiguo Yu Qiuju Bian Guizhen Liu Na Wang |
| Institution: | 1. School of computer Science, Qufu Normal University, 276826, Rizhao, P. R. China 2. School of Mathematics and Information science, Shandong University of Technology, 250100, Zibo, P. R. China 3. School of Mathematics and Information science, Shandong University of Technology, 250100, Jinan, P. R. China |
| Abstract: | A simple graphG is said to be fractionaln-factor-critical if after deleting anyn vertices the remaining subgraph still has a fractional perfect matching. For fractionaln-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |