✦ LIBER ✦

On the harmonic index and the chromatic number of a graph

✍ Scribed by Deng, Hanyuan; Balachandran, S.; Ayyaswamy, S.K.; Venkatakrishnan, Y.B.

Book ID: 122649043
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 353 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.04.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

On the Path-Chromatic Number of a Graph

✍ GARRY JOHNS; FARROKH SABA 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

On the edge-chromatic number of a graph

✍ Lowell W. Beineke; Robin J. Wilson 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 427 KB

On the harmonious chromatic number of a

On the harmonious chromatic number of a graph

✍ John Mitchem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe

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.

On the Chromatic Number of Graphs

✍ S. Butenko; P. Festa; P. M. Pardalos 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 174 KB