1 paper · 1 filter
Mehmet Akif Yetim
We provide upper bounds on the L(p,q)-labeling number of graphs which have interval (or circular-arc) representations via simple greedy algorithms. We prove that there exists an…