𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the pseudoachromatic index of the complete graph

✍ Scribed by M. Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros;; Ricardo Strausz

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
162 KB
Volume
66
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Let q = 2 be, for some ∈ N, and let n = q 2 +q +1. By exhibiting a complete coloring of the edges of K n , we show that the pseudoachromatic number (G n ) of the complete line graph G n = L(K n )-or the pseudoachromatic index of K n , if you will-is at least q 3 +q. This bound improves the implicit bound of Jamison [Discrete Math 74 (1989), 99-115] which is given in terms of the achromatic number: (G n ) ≥ (G n ) ≥ q 3 +1. We also calculate, precisely, the pseudoachromatic number when q +1

📜 SIMILAR VOLUMES

The chromatic index of complete multipar
The chromatic index of complete multipartite graphs
✍ D. G. Hoffman; C. A. Rodger 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract We show that a complete multipartite graph is class one if and only if it is not eoverfull, thus determining its chromatic index.

On perfect Γ-decompositions of the compl
On perfect Γ-decompositions of the complete graph
✍ Marco Buratti; Anita Pasotti 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract Generalizing the well‐known concept of an __i__‐perfect cycle system, Pasotti [Pasotti, in press, Australas J Combin] defined a Γ‐decomposition (Γ‐factorization) of a complete graph __K__~__v__~ to be __i‐perfect__ if for every edge [__x__, __y__] of __K__~__v__~ there is exactly one bl

On the number of triangular embeddings o
On the number of triangular embeddings of complete graphs and complete tripartite graphs
✍ M. J. Grannell; M. Knor 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__→∞, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many