P. Petrosyan

Local measures of interval edge-uncolorability

An interval edge coloring of a graph is a proper edge coloring by integers such that the colors on the edges incident with any vertex form an interval of integers. Not all graphs are interval colorable; a simple counterexample is $K_3$. The (interval coloring) deficiency of a graph $G$ is the minimum number of pendant...