Codings of graphs with binary edge labels

DOI10.1007/BF01202464zbMath0795.05124OpenAlexW2030289619MaRDI QIDQ1323484

Eberhard Triesch, Martin Aigner

Publication date: 4 September 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

codingbinary edge labels

Mathematics Subject Classification ID

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

Related Items (4)

Binary labeling of graphs ⋮ Set-Valued Graphs: A Survey ⋮ Realization of digraphs in Abelian groups and its consequences ⋮ Graph labelings in elementary abelian groups

Cites Work

• Irregular Assignments of Trees and Forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Codings of graphs with binary edge labels