๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs

โœ Scribed by S. Francis Raj; R. Balakrishnan

Book ID
108120716
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
193 KB
Volume
34
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New bounds for the chromatic number of g
New bounds for the chromatic number of graphs
โœ Manouchehr Zaker ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 184 KB ๐Ÿ‘ 1 views

## Abstract In this article we first give an upper bound for the chromatic number of a graph in terms of its degrees. This bound generalizes and modifies the bound given in 11. Next, we obtain an upper bound of the order of magnitude ${\cal O}({n}^{{1}-\epsilon})$ for the coloring number of a graph

The vertex-face total chromatic number o
The vertex-face total chromatic number of Halin graphs
โœ Lam, Peter C. B.; Zhang, Zhongfu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 69 KB ๐Ÿ‘ 2 views

In this paper, we shall first prove that for a Halin graph G, 4 ยฐxT (G) ยฐ6, where x T (G) is the vertex-face total chromatic number of G. Second, we shall establish a sufficient condition for a Halin graph to have a vertex-face total chromatic number of 6. Finally, we shall give a necessary and suff