scientific article; zbMATH DE number 15351

MaRDI QIDQ3971995zbMATH OpenFDO

Authors Martin Aigner, Eberhard Triesch

Publication date 25 June 1992

zbMATH Keywords

irregular assignmentweighting

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• Irregular Assignments of Trees and Forests
• Irregularity strength of dense graphs
• scientific article; zbMATH DE number 4142073
• A new upper bound for the irregularity strength of graphs
• On the number of irregular assignments on a graph

Cited in

(12)

• On the number of irregular assignments on a graph
• Codings of graphs with binary edge labels
• Binary labeling of graphs
• Vertex-distinguishing edge-colorings of 2-regular graphs
• Distant total sum distinguishing index of graphs
• A smallest irregular oriented graph containing a given diregular one
• The irregular coloring number of a tree
• A note on the total detection numbers of cycles
• On the total detection numbers of complete bipartite graphs
• scientific article; zbMATH DE number 1416477 (Why is no real title available?)
• An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
• A note on sequences variant of irregularity strength for hypercubes

This page was built for publication:

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