scientific article; zbMATH DE number 1409224
From MaRDI portal
Publication:4940064
Recommendations
Cited in
(54)- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- Distance-two labellings of Hamming graphs
- Relating path coverings to vertex labellings with a condition at distance two
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- No-hole \(L(2,1)\)-colorings
- Systems of distant representatives
- \(L(2,1)\)-labeling of direct product of paths and cycles
- Generalized list \(T\)-colorings of cycles
- Theory of computational complexity. Part 7. Transl. from the Russian
- On L(2,1)-labelings of Cartesian products of paths and cycles
- Distance-two labelings of graphs
- A note on exact distance labeling
- Distance two surjective labelling of paths and interval graphs
- On representations of graphs as two-distance sets
- Extremal problems on consecutive \(L(2,1)\)-labelling
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- A survey on labeling graphs with a condition at distance two
- Optimal \(L(d,1)\)-labelings of certain direct products of cycles and Cartesian products of cycles
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- Distance labeling in graphs (extended abstract)
- Distance two labeling on special family of graphs
- Some properties of labelling graphs with a condition on neighborhood
- L(2,l)-labellings of integer distance graphs
- Radio mean labeling of a graph
- Distance Labeling for Permutation Graphs
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- Labelling Graphs with a Condition at Distance 2
- Reachability and Distance Queries via 2-Hop Labels
- Graph distance‐dependent labeling related to code assignment in computer networks
- Labeling Mycielski graphs with a condition at distance two.
- scientific article; zbMATH DE number 841588 (Why is no real title available?)
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- L(2,1)-labeling of Kneser graphs and coloring squares of Kneser graphs
- The L (2, 1)-labeling number of two special graphs
- scientific article; zbMATH DE number 7085004 (Why is no real title available?)
- Distance labelings: a generalization of Langford sequences
- On the L(2, 1)-labelling of block graphs
- Distance labellings of graphs
- On L(2,1)-labellings of distance graphs
- scientific article; zbMATH DE number 2220954 (Why is no real title available?)
- scientific article; zbMATH DE number 7637429 (Why is no real title available?)
- Labeling trees with a condition at distance two
- Labeling trees with a condition at distance two
- Fixed-parameter complexity of \(\lambda\)-labelings
- L(4, 3, 2, 1)-path coloring of certain classes of graphs
- The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
- On distance two labelling of unit interval graphs
- The \(L(2,1)\)-labeling on planar graphs
- Distance-two labelings of digraphs
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
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 Q4940064)
