Codings of graphs with binary edge labels

DOI10.1007/BF01202464MaRDI QIDQ1323484zbMATH OpenOpenAlexFDO

Authors Martin Aigner, Eberhard Triesch

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)

Recommendations

• scientific article; zbMATH DE number 4139806
• Binary labeling of graphs
• scientific article; zbMATH DE number 969177

Cites work

• scientific article; zbMATH DE number 15351 (Why is no real title available?)
• scientific article; zbMATH DE number 3458691 (Why is no real title available?)
• scientific article; zbMATH DE number 867641 (Why is no real title available?)
• Irregular Assignments of Trees and Forests
• On set labelings of graphs

Cited in

(10)

• Minimal Graphs with a Specified Code Map Image
• scientific article; zbMATH DE number 5300021 (Why is no real title available?)
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Set-Valued Graphs: A Survey
• scientific article; zbMATH DE number 1803166 (Why is no real title available?)
• scientific article; zbMATH DE number 4139806 (Why is no real title available?)
• scientific article; zbMATH DE number 3904625 (Why is no real title available?)
• Realization of digraphs in Abelian groups and its consequences
• Graph labelings in elementary abelian groups
• Binary labeling of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323484)