\(L(h,1,1)\)-labeling of outerplanar graphs
From MaRDI portal
Publication:1014311
DOI10.1007/s00186-008-0261-6zbMath1161.05338OpenAlexW2033825560MaRDI QIDQ1014311
Paola Vocca, Emanuele G. Fusco, Tiziana Calamoneri, Richard B. Tan
Publication date: 27 April 2009
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0261-6
Related Items (7)
\(L(3,2,1)\)-labeling of triangular and toroidal grids ⋮ \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs ⋮ Distance three labelings of trees ⋮ Unnamed Item ⋮ Distance-constrained labellings of Cartesian products of graphs ⋮ On relationship between Hamiltonian path and holes in \(L(3, 2, 1)\)-coloring of minimum span ⋮ Linear and cyclic distance-three labellings of trees
Cites Work
- \(L(h,1)\)-labeling subclasses of planar graphs
- A survey on labeling graphs with a condition at distance two
- Labelling Graphs with a Condition at Distance 2
- Approximations for -Colorings of Graphs
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- On Colorings of Squares of Outerplanar Graphs
This page was built for publication: \(L(h,1,1)\)-labeling of outerplanar graphs
