\(L(2,1)\)-labeling of interval graphs
From MaRDI portal
Publication:500005
DOI10.1007/S12190-014-0846-6zbMath1326.05134OpenAlexW2106447343MaRDI QIDQ500005
Anita Pal, Satyabrata Paul, Madhumangal Pal
Publication date: 7 October 2015
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-014-0846-6
Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
A linear time algorithm to compute square of interval graphs and their colouring ⋮ \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs ⋮ \(L(0,1)\)-labelling of permutation graphs ⋮ L(2,1,1)-labeling of interval graphs ⋮ Distance two surjective labelling of paths and interval graphs ⋮ \(L(p,q)\)-label coloring problem with application to channel allocation ⋮ Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures ⋮ L(3,2,1)-Labeling problems on trapezoid graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- Maximum weight independent set of circular-arc graph and its application
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- An optimal greedy heuristic to color interval graphs
- Labeling bipartite permutation graphs with a condition at distance two
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- Algorithmic graph theory and perfect graphs
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- On the \(L(p,1)\)-labelling of graphs
- A survey on labeling graphs with a condition at distance two
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- L(2, 1)-labellings for direct products of a triangle and a cycle
- Distance three labellings for K n ×K 2
- Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
- Labelling Graphs with a Condition at Distance 2
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- Approximations for -Colorings of Graphs
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- A Radio Coloring of a Hypercube
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
- The $L(2,1)$-Labeling Problem on Graphs
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- On theL(2, 1)-labelling of block graphs
- Thek-neighbourhood-covering problem on interval graphs
This page was built for publication: \(L(2,1)\)-labeling of interval graphs
