\(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs

DOI10.1016/J.AKCEJ.2017.03.002zbMath1375.05230OpenAlexW2598610933MaRDI QIDQ1680868

Sk Amanathulla, Madhumangal Pal

Publication date: 17 November 2017

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2017.03.002

zbMATH Keywords

interval graphsfrequency assignment\(L(3, 2, 1)\)-labeling\(L(4, 3, 2, 1)\)-labeling

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

\(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ L(2,1,1)-labeling of interval graphs ⋮ Unnamed Item ⋮ Distance two surjective labelling of paths and interval graphs ⋮ On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs ⋮ L(3,2,1)-Labeling problems on trapezoid graphs

Cites Work

• Unnamed Item
• A linear time algorithm to compute square of interval graphs and their colouring
• Optimal \(L(\delta_1,\delta_2,1)\)-labeling of eight-regular grids
• \(L(3,2,1)\)-labeling of graphs
• \(L(2,1)\)-labeling of interval graphs
• On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
• \(L(h,1,1)\)-labeling of outerplanar graphs
• \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
• Distance-two labelings of graphs
• Approximate L(δ₁,δ₂,…,δ_t)‐coloring of trees and interval graphs
• Labelling Graphs with a Condition at Distance 2
• Labeling Chordal Graphs: Distance Two Condition
• Approximations for  -Colorings of Graphs
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph

This page was built for publication: \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs