The irregular coloring number of a tree

DOI10.1016/0012-365X(93)E0225-SzbMath0829.05027MaRDI QIDQ1894778

Anita C. Burris

Publication date: 10 January 1996

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

zbMATH Keywords

treeedge-coloringirregular coloring number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

On the total detection numbers of complete bipartite graphs ⋮ Gap vertex-distinguishing edge colorings of graphs ⋮ Extremal problems on detectable colorings of trees ⋮ A note on the total detection numbers of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The irregular coloring number of a tree