A note on L (2, 1)-labelling of trees
From MaRDI portal
Recommendations
- The \(L(2,1)\)-labelling of trees
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
- scientific article; zbMATH DE number 7295442
- The \(L(h,1,1)\)-labelling problem for trees
- scientific article; zbMATH DE number 2197903
- L(p,2,1)-labeling of the infinite regular trees
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
- On γ-labelings of trees
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- A Linear Time Algorithm for L(2,1)-Labeling of Trees
Cites work
- A survey on labeling graphs with a condition at distance two
- An extremal problem on non-full colorable graphs
- Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
- Extremal problems on consecutive \(L(2,1)\)-labelling
- Full Color Theorems for L(2,1)-Colorings
- Graph labeling and radio channel assignment
- Labelling Graphs with a Condition at Distance 2
- On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
- Relating path coverings to vertex labellings with a condition at distance two
- The $L(2,1)$-Labeling Problem on Graphs
- The \(L(2,1)\)-labelling of trees
Cited in
(20)- \(L(1,2)\)-labeling for square graph of some trees
- Solutions of some \(L(2, 1)\)-coloring related open problems
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
- On critical trees labeled with a condition at distance two
- A tree labeling problem
- On the finding 2-(k,l)-core of a tree with arbitrary real weight
- The \(L(h,1,1)\)-labelling problem for trees
- On \(\alpha\)-labellings of lobsters and trees with a perfect matching
- Some classes of trees with maximum number of holes two
- scientific article; zbMATH DE number 5630513 (Why is no real title available?)
- A theorem on labelled trees and the limits of its provability
- Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
- scientific article; zbMATH DE number 7295442 (Why is no real title available?)
- A characterization of L(2, 1)-labeling number for trees with maximum degree 3
- Infinitely many trees with maximum number of holes zero, one, and two
- scientific article; zbMATH DE number 2197903 (Why is no real title available?)
- \(\lambda\)-number of banana trees
- scientific article; zbMATH DE number 3926929 (Why is no real title available?)
- The \(L(2,1)\)-labelling of trees
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
This page was built for publication: A note on \(L (2, 1)\)-labelling of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511194)
