scientific article; zbMATH DE number 881282
From MaRDI portal
Publication:4879166
Recommendations
Cited in
(34)- \(L(2,1)\)-labeling of direct product of paths and cycles
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- Radio number for trees
- A survey on labeling graphs with a condition at distance two
- Some properties of labelling graphs with a condition on neighborhood
- scientific article; zbMATH DE number 841588 (Why is no real title available?)
- A bound on the chromatic number of the square of a planar graph
- On critical trees labeled with a condition at distance two
- Distance-two labelings of digraphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- scientific article; zbMATH DE number 6940804 (Why is no real title available?)
- On distance constrained labeling of disk graphs
- Systems of distant representatives
- Backbone coloring for graphs with large girths
- Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Labeling trees with a condition at distance two
- On island sequences of labelings with a condition at distance two
- Greedy \(F\)-colorings of graphs
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- Online coloring of disk graphs
- A note on collections of graphs with non-surjective lambda labelings
- On a distance-constrained graph labeling to model cooperation
- No-hole \(L(2,1)\)-colorings
- scientific article; zbMATH DE number 2191985 (Why is no real title available?)
- Distance-two labelings of graphs
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- List backbone colouring of graphs
- Theory of computational complexity. Part 7. Transl. from the Russian
- On the universality and extremality of graphs with a distance constrained colouring
- Distance-2 labeling of threshold graphs
- Labeling trees with a condition at distance two.
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 Q4879166)
