✦ LIBER ✦

On the chromatic index of multigraphs without large triangles

✍ Scribed by Henry A Kierstead

Book ID: 107884195
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 232 KB
Volume: 36
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90022-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the chromatic index of mul

Approximating the chromatic index of multigraphs

✍ Guantao Chen; Xingxing Yu; Wenan Zang 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 654 KB

The chromatic index of nearly bipartite

The chromatic index of nearly bipartite multigraphs

✍ Larry Eggan; Michael Plantholt 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Asymptotics of the Chromatic Index for M

Asymptotics of the Chromatic Index for Multigraphs

✍ Jeff Kahn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 835 KB

For a multigraph G, let D(G) denote maximum degree and set We show that the chromatic index /$(G) is asymptotically max[D(G), 1(G)]. The latter is, by a theorem of Edmonds (1965), the fractional chromatic index of G, and the asymptotics established here are part of a conjecture of the author predic

A sublinear bound on the chromatic index

A sublinear bound on the chromatic index of multigraphs

✍ Michael Plantholt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 894 KB

Asymptotics of the list-chromatic index

Asymptotics of the list-chromatic index for multigraphs

✍ Jeff Kahn 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB 👁 1 views

A note concerning the chromatic index of

A note concerning the chromatic index of multigraphs

✍ A. J. W. Hilton; Bill Jackson 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

We improve an upper bound for the chromatic index of a multigraph due to Andersen and Gol'dberg. As a corollary w e deduce that if no t w o edges of multiplicity at least t w o in G are adjacent, then ,y'(G) s A ( G ) + 1. In addition w e generalize results concerning the structure of critical graph