✦ LIBER ✦

Chromatic equivalence classes of complete tripartite graphs

✍ Scribed by G.L. Chia; Chee-Kit Ho

Book ID: 108113987
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 588 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.12.059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromatic uniqueness of certain complete

Chromatic uniqueness of certain complete tripartite graphs

✍ G. C. Lau; Y. H. Peng 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 194 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

On the chromatic equivalence class of gr

On the chromatic equivalence class of graphs

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

A complete solution to a conjecture on c

A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs

✍ Ruying Liu; Haixing Zhao; Chengfu Ye 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 160 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 a

On the chromatic equivalence class of a family of graphs

✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Let P\* denote the graph obtained by joining a new vertex to every vertex of a path on n vertices. Let Ui,j(n) denote the set of all connected graphs obtained from PfwP\* by connecting the four vertices of degree 2 by two paths of lengths s( 1> 0) and t( ~> 1) such that s + t = n -i -j is a constant