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

A bound on the chromatic number of graphs without certain induced subgraphs

โœ Scribed by Stanley Wagon

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
144 KB
Volume
29
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A bound on the chromatic number of a gra
A bound on the chromatic number of a graph
โœ Paul A. Catlin ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.

Another bound on the chromatic number of
Another bound on the chromatic number of a graph
โœ Paul A. Catlin ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 422 KB

Let C be a simple graph. let JiGI denote the maximum degree of it\ \erlicek. ,III~ Ic~r \ 1 C; 1 denote irs chromatic pumber. Brooks' Theorem asserb lha1 ytG I'--AI G I. unk\\ C; hd.. .I component that is a COI lplete graph K,,,,\_ ,. or ullesq .I1 G I = 2 and G ha\ ;~n c~rld C\CIC

On bounding the chromatic number of L-gr
On bounding the chromatic number of L-graphs
โœ Sean McGuinness ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 585 KB

We show that the intersection graph of a collection of subsets of the plane, where each subset forms an "L" shape whose vertical stem is infinite, has its chromatic number 1 bounded by a function of the order of its largest clique w, where it is shown that ;1<2"4'3"4"'~'-". This proves a special cas