Notes on the binding numbers for (a, b, k)-critical graphs

Publisher： Cambridge University Press

E-ISSN： 1755-1633|76|2|307-314

ISSN： 0004-9727

Source： Bulletin of the Australian Mathematical Society, Vol.76, Iss.2, 2007-10, pp. : 307-314

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Let G be a graph of order n, and let a, b, k be nonnegative integers with 1 ≤ a < b. An [a, b]-factor of graph G is defined as a spanning subgraph F of G such that a ≤ dF(x) ≤ b for each x V (F). Then a graph G is called an (a, b, k)-critical graph if after deleting any k vertices of G the remaining graph of G has an [a, b]-factor. In this paper, it is proved that G is an (a, b, k)-critical graph if the binding numberand

Related content

Binding numbers for fractional ID-k-factor-critical graphs

By Zhou Si  

Acta Mathematica Sinica, Vol. 30, Iss. 1, 2014-01 ,pp. : 181-186 (6)

Springer Publishing Company

Access to resources Recommend Favorite

NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 77, Iss. 2, 2008-04 ,pp. : 277-283 (7)

Cambridge University Press

Access to resources Recommend Favorite

On all fractional (a, b, k)-critical graphs

By Zhou Si   Sun Zhi  

Acta Mathematica Sinica, Vol. 30, Iss. 4, 2014-04 ,pp. : 696-702 (7)

Springer Publishing Company

Access to resources Recommend Favorite

BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 85, Iss. 1, 2011-10 ,pp. : 60-67 (8)

Cambridge University Press

Access to resources Recommend Favorite

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 86, Iss. 2, 2012-02 ,pp. : 177-183 (7)

Cambridge University Press

Access to resources Recommend Favorite