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 adF(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