On equitable vertex distinguishing edge colorings of trees

DOI10.1016/S0252-9602(13)60025-9MaRDI QIDQ2437139zbMATH OpenOpenAlexFDO

Authors Bing Yao, Songling Shan, Xiang'en Chen

Publication date 28 February 2014

Published in Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0252-9602(13)60025-9

zbMATH Keywords

equitable coloringtreesvertex distinguishing edge coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the vertex distinguishing equitable edge-coloring of graphs
• Vertex-distinguishing proper edge colourings of some regular graphs
• Vertex-distinguishing proper edge-colorings
• The irregular coloring number of a tree
• D(r)-vertex distinguishing edge coloring of trees

Cited in

(3)

• A note on graph proper total colorings with many distinguishing constraints
• scientific article; zbMATH DE number 6863823 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004

This page was built for publication: On equitable vertex distinguishing edge colorings of trees

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