1 research outputs found
-Labeling of Graphs with Interval Representations
We provide upper bounds on the -labeling number of graphs which have
interval (or circular-arc) representations via simple greedy algorithms. We
prove that there exists an -labeling with span at most
for interval
-graphs, for interval graphs,
for circular arc graphs, for
permutation graphs and for cointerval graphs. In
particular, these improve existing bounds on -labeling of interval and
circular arc graphs and -labeling of permutation graphs. Furthermore,
we provide upper bounds on the coloring of the squares of aforementioned
classes