𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Sum Coloring Problem on Interval Graphs

✍ Scribed by S. Nicoloso; M. Sarrafzadeh; X. Song

Publisher
Springer
Year
1999
Tongue
English
Weight
203 KB
Volume
23
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Investigation on Interval Edge-Colorings
Investigation on Interval Edge-Colorings of Graphs
✍ A.S. Asratian; R.R. Kamalian πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 380 KB

An edge-coloring of a simple graph \(G\) with colors \(1,2, \ldots, t\) is called an interval \(t\)-coloring [3] if at least one edge of \(G\) is colored by color \(i, i=1, \ldots, t\) and the edges incident with each vertex \(x\) are colored by \(d_{G}(x)\) consecutive colors, where \(d_{G}(x)\) is