78
Views
14
CrossRef citations to date
0
Altmetric
Section A

A sufficient condition for a graph to be an (a, b, k)-critical graph

Pages 2202-2211 | Received 01 Aug 2008, Accepted 22 Jan 2009, Published online: 17 Jun 2010
 

Abstract

Let G be a graph, and let a, b, k be integers with 0≤ab, k≥0. An [a, b]-factor of graph G is defined as a spanning subgraph F of G such that ad F (x)≤b for each xV(G). 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 article, a sufficient condition is given, which is a neighborhood condition for a graph G to be an (a, b, k)-critical graph.

2000 AMS Subject Classification :

Acknowledgements

The author would like to express his gratitude to the referees for their very helpful and detailed comments in improving this article. This research was supported by Jiangsu Provincial Educational Department (07KJD110048) and was sponsored by the Qing Lan Project of Jiangsu Province.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 1,129.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.