首页 / 资料库 / 文献详情

On Solutions of Alspach’s Problems

刘桂真

1994中国科学通报：英文版Computer Science被引 0

摘要

1 Introduction The graphs considered in this note will be finite undirected graphs which have nomuliple edges or loops. Let G be a graph with a vertex set V(G) and edge set E(G).For a vertex x of G the degree of x in G is denoted by d_G(x). Let g and f be two in-teger-valued functions defined on V(G) such that g(x)≤f(x) for every x∈V(G). Then a(g,f)-factor of G is a spanning subgraph H of G satisfying g(x)≤d_H(x)≤f(x) for all

引用本文（GB/T 7714）