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₁,d₂)-labeling problem on graphs
- The L(3,2,1)-labeling on bipartite graphs
- L(3,1)-labeling of circulant graphs
Cited in
(38)- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- A distance-labelling problem for hypercubes
- The \(L(d,1)\)-number of powers of paths
- On \(L(d,1)\)-labelings of graphs
- Pair \(L(2, 1)\)-labelings of infinite graphs
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- Group path covering and distance two labeling of graphs
- Distance-constrained labeling of complete trees
- L(p,q) labeling of d-dimensional grids
- A survey on labeling graphs with a condition at distance two
- 3-equitable labelings of ladders and graphs related to cycles
- The L(2,1)-labeling of certain generalized Petersen graphs
- L (d,1)-labelings of the Möbius ladders
- scientific article; zbMATH DE number 5812224 (Why is no real title available?)
- L(2,1)-labeling of graphs: known results and open problems
- L(2,1)-labeling of flower snark and related graphs.
- The L (3, 2, 1)-labeling problem on graphs
- The L(d₁,d₂)-labeling problem on graphs
- The L(3,2,1)-labeling problem on graphs
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- Pair Labelings of Graphs
- Labeling Chordal Graphs: Distance Two Condition
- L(3,2,1)-labeling of graphs
- The game \(L(d,1)\)-labeling problem of graphs
- scientific article; zbMATH DE number 7009474 (Why is no real title available?)
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- L(3,2,1)-labeling problems on trapezoid graphs
- On the L(2, 1)-labelling of block graphs
- L(3,2,1)-labelling of graphs
- scientific article; zbMATH DE number 2197903 (Why is no real title available?)
- Edge span of L(d,1)-labeling on some graphs
- \(L(d,1)\)-labeling of regular tilings
- Frequency assignment through combinatorial optimization approach
- Upper bound of \(L\binom{0,1,2}{d,d,1}\)-labeling number of a class of fissile graphs
- scientific article; zbMATH DE number 7710903 (Why is no real title available?)
- The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
- List version of L(d,s)-labelings
- Labeling graphs with two distance constraints
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)
