✦ LIBER ✦

A Bound on the Chromatic Number of an Almost Planar Graph

✍ Scribed by Nenashev, G. V.

Book ID: 121571425
Publisher: Springer US
Year: 2014
Tongue: English
Weight: 296 KB
Volume: 196
Category: Article
ISSN: 1573-8795
DOI: 10.1007/s10958-014-1693-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A bound on the chromatic number of the s

A bound on the chromatic number of the square of a planar graph

✍ Michael Molloy; Mohammad R. Salavatipour 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 346 KB

An Upper Bound on the Number of Edges in

An Upper Bound on the Number of Edges in an Almost Planar Bipartite Graph

✍ Karpov, D. V. 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 348 KB

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

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

On an upper bound for the harmonious chr

On an upper bound for the harmonious chromatic number of a graph

✍ Zhikang Lu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph that has been given by Sin‐Min Lee and John Mitchem is improved.