L(2,1,1)-labeling of interval graphs

DOI10.1142/s2661335222500034OpenAlexW4303981508MaRDI QIDQ6107729

Sk Amanathulla, Biswajit Bera, Madhumangal Pal

Publication date: 3 July 2023

Published in: International Journal of Mathematics for Industry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s2661335222500034

zbMATH Keywords

interval graphefficient algorithmfrequency assignment\(L211\)-labeling

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Related Items (1)

L(2,1,1)-labeling of interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(3,2,1)\)-labeling of graphs
• \(L(2,1)\)-labeling of interval graphs
• \(L(0,1)\)-labelling of permutation graphs
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
• On the \(L(p,1)\)-labelling of graphs
• A bound on the chromatic number of the square of a planar graph
• Labelling Graphs with a Condition at Distance 2
• Approximations for  -Colorings of Graphs
• Coloring the square of a planar graph
• L(3,2,1)-Labeling problems on trapezoid graphs
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• L(2,1,1)-labeling of interval graphs

This page was built for publication: L(2,1,1)-labeling of interval graphs