L(h,1,1)-Labeling of Outerplanar Graphs

DOI10.1007/11780823_21zbMath1222.05229OpenAlexW1514570928MaRDI QIDQ3613657

Emanuele G. Fusco, Richard B. Tan, Paola Vocca, Tiziana Calamoneri

Publication date: 12 March 2009

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780823_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

\(L(p,2,1)\)-labeling of the infinite regular trees ⋮ The \(L(h,1,1)\)-labelling problem for trees ⋮ Distance three labellings for K _n ×K ₂

This page was built for publication: L(h,1,1)-Labeling of Outerplanar Graphs