Search

Your search keyword '"Subramanian, C.R."' showing total 2 results
Start Over Author "Subramanian, C.R." Topic clique number
2 results on '"Subramanian, C.R."'

1. Bounding χ in terms of ω and Δ for some classes of graphs

Author

Aravind, N.R., Karthick, T., and Subramanian, C.R.

Subjects
Maximum degree, Chromatic number, Vertex coloring, Clique number
Abstract

Reed [B. Reed, ω,Δ and χ, Journal of Graph Theory, 27 (1998) 177–212] conjectured that for any graph G, χ(G)≤⌈Δ(G)+ω(G)+12⌉, where χ(G), ω(G), and Δ(G) respectively denote the chromatic number, the clique number and the maximum degree of G. In this paper, we verify this conjecture for some special classes of graphs which are defined by families of forbidden induced subgraphs.

Full Text
View/download PDF

2. Bounding in terms of and for some classes of graphs

Author

Aravind, N.R., Karthick, T., and Subramanian, C.R.

Subjects
*GRAPH theory, *LOGICAL prediction, *GRAPH coloring, *PATHS & cycles in graph theory, *COMBINATORICS, *MATHEMATICAL analysis
Abstract

Abstract: Reed [B. Reed, and , Journal of Graph Theory, 27 (1998) 177–212] conjectured that for any graph , , where , , and respectively denote the chromatic number, the clique number and the maximum degree of . In this paper, we verify this conjecture for some special classes of graphs which are defined by families of forbidden induced subgraphs. [Copyright &y& Elsevier]

Published
2011
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results