On harmonious colouring of trees

MaRDI QIDQ426747zbMATH OpenFDO

Authors A. Aflaki, S. Akbari, D. S. Eskandani, Keith Edwards, H. Ravanbod, M. Jamaali

Publication date 12 June 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i1p3

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

harmonious chromatic number

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the harmonious colouring of trees.
• Harmonious coloring of trees with large maximum degree
• The Harmonious Chromatic Number of Almost All Trees
• The Harmonious Chromatic Number of Bounded Degree Graphs
• The Harmonious Chromatic Number of Bounded Degree Trees

Cited in

(12)

• scientific article; zbMATH DE number 5492384 (Why is no real title available?)
• Minimally colored trees
• Harmonious coloring: parameterized algorithms and upper bounds
• Harmonious coloring of trees with large maximum degree
• The Harmonious Chromatic Number of Almost All Trees
• The complexity of harmonious colouring for trees
• On harmonious coloring of hypergraphs
• Harmonious coloring: parameterized algorithms and upper bounds
• Harmonious colourings of graphs
• On graceful colorings of trees.
• The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
• On the harmonious colouring of trees.

This page was built for publication: On harmonious colouring of trees

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