✦ LIBER ✦

RECENT RESULTS ON CHROMATICALLY EQUIVALENT GRAPHS

✍ Scribed by Ruth A. Bari

Book ID: 118717636
Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 390 KB
Volume: 319
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1979.tb32772.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pairs of Chromatically Equivalent Graphs

✍ Kerri Morgan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 351 KB

Classes of chromatically unique or equiv

Classes of chromatically unique or equivalent graphs

✍ Mieczys[lstrok]aw Borowiecki; Ewa Drgas-Burchardt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 439 KB

Classes of chromatically equivalent grap

Classes of chromatically equivalent graphs and polygon trees

✍ Shaoji Xu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 747 KB

On the chromatic equivalence class of gr

On the chromatic equivalence class of graphs

✍ G.L. Chia 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 426 KB

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

Chromatic equivalence classes of complet

Chromatic equivalence classes of complete tripartite graphs

✍ G.L. Chia; Chee-Kit Ho 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 588 KB