✦ LIBER ✦

The edge chromatic difference sequence of a cubic graph

✍ Scribed by Michael O. Albertson; Ruth Haas

Book ID: 108316121
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 360 KB
Volume: 177
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00368-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The chromatic difference sequence of a g

The chromatic difference sequence of a graph

✍ Michael O Albertson; David M Berman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 713 KB

On the ultimate normalized chromatic dif

On the ultimate normalized chromatic difference sequence of a graph

✍ Huishan Zhou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 489 KB

For graphs G and H, the Cartesian product G × H is defined as follows: the vertex set is ## V(G) × V(H), and two vertices (g,h) and (9',h') are adjacent in G × H if either g = g' and hh' E E(H) or h = h' and g9' E E(G). Let G k denote the Cartesian product of k copies of G. The chromatic differen

Graph products and the chromatic differe

Graph products and the chromatic difference sequence of vertex-transitive graphs

✍ Claude Tardif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 386 KB

On the edge-chromatic number of a graph

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

The chromatic difference sequence of the

The chromatic difference sequence of the Cartesian product of graphs

✍ Huishan Zhou 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 953 KB

Zhou, H., The chromatic difference sequence of the Cartesian product of graphs, Discrete Mathematics 90 (1991) 297-311. The chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by cds(G) = (a(l), a(2), . . , a(n)) if the sum of a(l), a(2), . , a(t) is the maximum numb

The b-Chromatic Number of Cubic Graphs

✍ Marko Jakovac; Sandi Klavžar 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 800 KB