...and Fractional (g,f)-Deleted Graphs (分数(g,f)-因子、分数(g,f)-覆盖图和分数(g,f)-消去图) The Factor of Graphs (图的因子) Several Results for k-deleted Bipartite Graph (关于k-消去二分图的一些结果) ..
基于1个网页-相关网页
Combining with the condition of C-partition and tetragon 2-factor, we give new classes of upper-embeddable graphs.
联系图的顶点划分和四边形2因子的条件，本文给出了新的上可嵌入的图类。
Degree sum conditions of ID-factor-critical graphs are studied. A lower bound for the degree sum of any two nonadjacent vertices such that G is ID-factor-critical is obtained, and the bound is sharp.
本文研究ID-因子临界图的度和条件，得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界，同时说明这些结果是最好可能的。
应用推荐