Codings of graphs with binary edge labels

DOI10.1007/BF01202464zbMATH Open0795.05124OpenAlexW2030289619MaRDI QIDQ1323484FDOQ1323484

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

Recommendations

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

zbMATH Keywords

codingbinary edge labels

Mathematics Subject Classification ID

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

Cites Work

• Irregular Assignments of Trees and Forests
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On set labelings of graphs

Cited In (10)

• Title not available (Why is that?)
• Codes and \(L(2,1)\)-labelings in Sierpiński graphs
• Set-Valued Graphs: A Survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Realization of digraphs in Abelian groups and its consequences
• Graph labelings in elementary abelian groups
• Binary labeling of graphs
• Minimal Graphs with a Specified Code Map Image

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)