scientific article; zbMATH DE number 2145257
From MaRDI portal
Publication:4657607
Recommendations
- \(L(3,2,1)\)-labeling of graphs
- \(L(3,2,1)\)-labelling of graphs
- The \(L(3,2,1)\)-labeling problem on graphs
- The \(L (3, 2, 1)\)-labeling problem on graphs
- On \(L(d,1)\)-labelings of graphs
- scientific article; zbMATH DE number 5812224
- scientific article; zbMATH DE number 7009474
- The \(L(d_1,d_2)\)-labeling problem on graphs
- The \(L(3,2,1)\)-labeling on bipartite graphs
- \(L(3,1)\)-labeling of circulant graphs
Cited in
(36)- The \(L(2,1)\)-labeling of certain generalized Petersen graphs
- Distance-constrained labeling of complete trees
- scientific article; zbMATH DE number 2197903 (Why is no real title available?)
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- On the \(L(2, 1)\)-labelling of block graphs
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- scientific article; zbMATH DE number 7710903 (Why is no real title available?)
- On \(L(d,1)\)-labelings of graphs
- scientific article; zbMATH DE number 5812224 (Why is no real title available?)
- Pair \(L(2, 1)\)-labelings of infinite graphs
- \(L(3,2,1)\)-labeling problems on trapezoid graphs
- scientific article; zbMATH DE number 7009474 (Why is no real title available?)
- The \(L(d_1,d_2)\)-labeling problem on graphs
- Labeling graphs with two distance constraints
- The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
- \(L (d,1)\)-labelings of the Möbius ladders
- \(L(3,2,1)\)-labeling of graphs
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- Frequency assignment through combinatorial optimization approach
- The game \(L(d,1)\)-labeling problem of graphs
- Group path covering and distance two labeling of graphs
- A distance-labelling problem for hypercubes
- \(L(2,1)\)-labeling of flower snark and related graphs.
- The \(L(d,1)\)-number of powers of paths
- \(L(2,1)\)-labeling of graphs: known results and open problems
- The \(L(3,2,1)\)-labeling problem on graphs
- \(L(3,2,1)\)-labelling of graphs
- A survey on labeling graphs with a condition at distance two
- The \(L (3, 2, 1)\)-labeling problem on graphs
- \(L(p,q)\) labeling of \(d\)-dimensional grids
- Edge span of \(L(d,1)\)-labeling on some graphs
- \(L(d,1)\)-labeling of regular tilings
- 3-equitable labelings of ladders and graphs related to cycles
- Upper bound of \(L\binom{0,1,2}{d,d,1}\)-labeling number of a class of fissile graphs
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- List version of L(d,s)-labelings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657607)