On (g, f)-Uniform Graphs
Authors: Liu, Gui-zhen; Liu, Yan
Source: Acta Mathematicae Applicatae Sinica, Volume 21, Number 1, February 2005 , pp. 67-76(10)
Abstract:A graph G is called a (g, f)-uniform graph if for each edge of G, there is a (g, f)-factor containing it and another (g, f)-factor excluding it. In this paper a necessary and sufficient condition for a graph to be a (g, f)-uniform graph is given and some applications of this condition are discussed. In particular, some simple sufficient conditions for a graph to be an [a, b]-uniform graph are obtained for a ≤ b.
Document Type: Research Article
Affiliations: Email: email@example.com
Publication date: 2005-02-01