𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On bounds for the index of double nested graphs

✍ Scribed by M. Andelić; C.M. da Fonseca; S.K. Simić; D.V. Tošić

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
262 KB
Volume
435
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved bounds for the chromatic index
Improved bounds for the chromatic index of graphs and multigraphs
✍ Hakimi, S. Louis; Schmeichel, Edward F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

We show that coloring the edges of a multigraph G in a particular order often leads to improved upper bounds for the chromatic index χ (G). Applying this to simple graphs, we significantly generalize recent conditions based on the core of G (i.e., the subgraph of G induced by the vertices of degree

A Bound on the Strong Chromatic Index of
A Bound on the Strong Chromatic Index of a Graph
✍ Michael Molloy; Bruce Reed 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 695 KB

We show that the strong chromatic index of a graph with maximum degree 2 is at most (2&=) 2 2 , for some =>0. This answers a question of Erdo s and Nes etr il. 1997 Academic Press ## 1. Introduction A strong edge-colouring of a (simple) graph, G, is a proper edge-colouring of G with the added res