✦ LIBER ✦

On the Path-Chromatic Number of a Graph

✍ Scribed by GARRY JOHNS; FARROKH SABA

Book ID: 119862776
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 248 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16408.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path chromatic numbers of graphs

✍ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 112 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

On Total Chromatic Number of a Graph

✍ Vijayaditya, N. 📂 Article 📅 1971 🏛 Oxford University Press 🌐 English ⚖ 96 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.

On path-chromatically unique graphs

✍ Esperanza Blancaflor Arugay; Severino Villanueva Gervacio 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

The least number of colors needed to color the vertices of a graph G such that the vertices in each color class induces a linear forest is called the path-chromatic number of G, denoted by Zoo (G). If all such colorings of the vertices of G induce the same partitioning of the vertices of G, we say