Labeling trees with a condition at distance two

DOI10.1016/S1571-0653(04)00529-3zbMath1246.05139MaRDI QIDQ5899358

Andrzej Pelc, Rossella Petreschi, Tiziana Calamoneri

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

A survey on labeling graphs with a condition at distance two

Cites Work

• Labeling Products of Complete Graphs with a Condition at Distance Two
• Labelling Graphs with a Condition at Distance 2
• The $L(2,1)$-Labeling Problem on Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Labeling trees with a condition at distance two