Title of article
Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs
Author/Authors
Raj، نويسنده , , S. Francis and Balakrishnan، نويسنده , , R.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
6
From page
353
To page
358
Abstract
We define nowhere dense and somewhere dense classes by means of counting of homomorphisms from test graphs. This seems to be bridging the gap between existential and counting theorems (for graph homomorphisms) and it has application to complexity of Boolean queries.
Keywords
achromatic number , b-chromatic number
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455150
Link To Document