Some results on (g, f)-uniform graphs

Authors

  • Gai, Jiansheng
  • Ge, Liansheng

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, some sufficient conditions for a graph to be a (g, f)-uniform graph are given and discussed.

Published

2012-09-09

How to Cite

Gai, Jiansheng, & Ge, Liansheng. (2012). Some results on (g, f)-uniform graphs. Utilitas Mathematica, 89. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/828

Issue

Vol. 89 (2012): Volume 89, 2012

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.