A note on L (2, 1)-labelling of trees
From MaRDI portal
Publication:511194
DOI10.1007/S10255-012-0151-9zbMATH Open1355.05219OpenAlexW2087974701MaRDI QIDQ511194FDOQ511194
Authors: Mingqing Zhai, Changhong Lu, Jinlong Shu 
Publication date: 14 February 2017
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-012-0151-9
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
Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Relating path coverings to vertex labellings with a condition at distance two
- The \(L(2,1)\)-labelling of trees
- Full Color Theorems for L(2,1)-Colorings
- Labelling Graphs with a Condition at Distance 2
- A survey on labeling graphs with a condition at distance two
- Graph labeling and radio channel assignment
- The $L(2,1)$-Labeling Problem on Graphs
- Extremal problems on consecutive \(L(2,1)\)-labelling
- An extremal problem on non-full colorable graphs
- Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
- On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
Cited In (19)
- Some classes of trees with maximum number of holes two
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- Solutions of some \(L(2, 1)\)-coloring related open problems
- Infinitely many trees with maximum number of holes zero, one, and two
- On critical trees labeled with a condition at distance two
- On the finding 2-(k,l)-core of a tree with arbitrary real weight
- \(L(1,2)\)-labeling for square graph of some trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(L(h,1,1)\)-labelling problem for trees
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
- On \(\alpha\)-labellings of lobsters and trees with a perfect matching
- A tree labeling problem
- The \(L(2,1)\)-labelling of trees
- A characterization of L(2, 1)-labeling number for trees with maximum degree 3
- Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
- A theorem on labelled trees and the limits of its provability
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)
