Labeling trees with a condition at distance two.
From MaRDI portal
Publication:1402073
DOI10.1016/S0012-365X(02)00750-1zbMath1035.05078OpenAlexW1991098243MaRDI QIDQ1402073
David W. Mauro, John P. Georges
Publication date: 19 August 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00750-1
Related Items (24)
OPTIMAL RADIOCOLORING OF TREES ⋮ Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees ⋮ Facial \(L(2, 1)\)-edge-labelings of trees ⋮ Distance-two labelings of digraphs ⋮ \(L(p,2,1)\)-labeling of the infinite regular trees ⋮ The \((p,q)\)-total labeling problem for trees ⋮ Group path covering and \(L(j,k)\)-labelings of diameter two graphs ⋮ Unnamed Item ⋮ \(L(2,1)\)-labeling of oriented planar graphs ⋮ Labelling of some planar graphs with a condition at distance two ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ \(L (j, k)\)- and circular \(L(j, k)\)-labellings for the products of complete graphs ⋮ Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ A survey on labeling graphs with a condition at distance two ⋮ Linear and cyclic distance-three labellings of trees ⋮ Labeling trees with a condition at distance two ⋮ A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
This page was built for publication: Labeling trees with a condition at distance two.
