✦ LIBER ✦

Continuum many universal Horn classes of graphs of bounded chromatic number

✍ Scribed by A. Bonato

Book ID: 105754738
Publisher: Springer
Year: 1998
Tongue: English
Weight: 133 KB
Volume: 40
Category: Article
ISSN: 0002-5240
DOI: 10.1007/s000120050084

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Upper Bounds of Entire Chromatic Number

Upper Bounds of Entire Chromatic Number of Plane Graphs

✍ W. Weifan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 35 KB

The entire chromatic number χ ve f (G) of a plane graph G is the least number of colors assigned to the vertices, edges and faces so that every two adjacent or incident pair of them receive different colors. conjectured that χ ve f (G) ≤ + 4 for every plane graph G. In this paper we prove the conj

Bounds on the Generalised Acyclic Chroma

Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs

✍ Catherine Greenhill; Oleg Pikhurko 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 143 KB

A bound for the game chromatic number of

A bound for the game chromatic number of graphs

✍ Thomas Dinski; Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 580 KB

We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particula

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