L(2,1,1)-labeling of interval graphs
From MaRDI portal
Publication:6107729
Recommendations
- L(2,1)-labeling of interval graphs
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
- An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs
- Distance two surjective labelling of paths and interval graphs
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
Cites work
- L(0,1)-labelling of permutation graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- L(2,1)-labeling of interval graphs
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
- L(3,2,1)-labeling of graphs
- L(3,2,1)-labeling problems on trapezoid graphs
- A bound on the chromatic number of the square of a planar graph
- Approximations for -Colorings of Graphs
- Coloring the square of a planar graph
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- L(2,1,1)-labeling of interval graphs
- Labelling Graphs with a Condition at Distance 2
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- On the \(L(p,1)\)-labelling of graphs
- The L(3,2,1)-labeling problem on graphs
Cited in
(3)
This page was built for publication: L(2,1,1)-labeling of interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6107729)
