The (p,q)-total Labeling Problem for Trees

DOI10.1007/978-3-642-17514-5_5zbMath1311.05170OpenAlexW2272305011MaRDI QIDQ3060760

Toshimasa Ishii, Toru Hasunuma, Yushi Uno, Hirotaka Ono

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_5

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The \((p,q)\)-total labeling problem for trees

This page was built for publication: The (p,q)-total Labeling Problem for Trees