Characterizations of graphs G having all [1, k]-factors in kG.

Discrete Mathematics(2019)

引用 1|浏览9
暂无评分
摘要
Let k≥1 be an integer and G be a graph. Let kG denote the graph obtained from G by replacing each edge of G with k parallel edges. We say that G has all [1,k]-factors or all fractional [1,k]-factors if G has an h-factor or a fractional h-factor for every function h:V(G)→{1,2,…,k} with h(V(G)) even. In this note, we come up with simple characterizations of a graph G such that kG has all [1,k]-factors or all fractional [1,k]-factors. These characterizations are extensions of Tutte’s 1-Factor Theorem and Tutte’s Fractional 1-Factor Theorem.
更多
查看译文
关键词
All (g,f)-factors,All fractional factors,Multigraph,Isolated vertices,Tutte-type theorem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要