A note on \(L (2, 1)\)-labelling of trees
From MaRDI portal
Publication:511194
DOI10.1007/s10255-012-0151-9zbMath1355.05219OpenAlexW2087974701MaRDI QIDQ511194
Chang-hong Lu, Ming-qing Zhai, Jin-Long 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
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Solutions of some \(L(2, 1)\)-coloring related open problems, Infinitely many trees with maximum number of holes zero, one, and two, Some classes of trees with maximum number of holes two, \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
Cites Work
- Relating path coverings to vertex labellings with a condition at distance two
- Extremal problems on consecutive \(L(2,1)\)-labelling
- An extremal problem on non-full colorable graphs
- The \(L(2,1)\)-labelling of trees
- A survey on labeling graphs with a condition at distance two
- Full Color Theorems for L(2,1)-Colorings
- Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- The $L(2,1)$-Labeling Problem on Graphs
- On the Structure of Graphs with Non-Surjective L(2,1)-Labelings