L(3,2,1)-labeling problems on trapezoid graphs
From MaRDI portal
Publication:5025142
Recommendations
Cites work
- scientific article; zbMATH DE number 7009334 (Why is no real title available?)
- Approximate L(δ1,δ2,…,δt)‐coloring of trees and interval graphs
- Labelling Graphs with a Condition at Distance 2
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- The \(L(3,2,1)\)-labeling problem on graphs
- 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
- \(T\)-colorings of graphs: recent results and open problems
- \(l(3,2,1)\)-labeling for the product of a complete graph and a cycle
Cited in
(6)- Minimization of span in \(L(3,1)\)-labeling for a particular type of intersection graphs
- \(L(3, 2, 1)\)-labeling of certain planar graphs
- Optimal \(L(3, 2, 1)\)-labeling of triangular lattice
- L(2,1,1)-labeling of interval graphs
- \(L(3, 2, 1)\)-labeling problem of square of path
- Certain operations on interval-valued picture fuzzy graphs with application
This page was built for publication: \(L(3,2,1)\)-labeling problems on trapezoid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025142)