The harmonious coloring number of a graph

DOI10.1016/0012-365X(91)90257-3zbMath0756.05056MaRDI QIDQ1182896

S. Singh

Publication date: 28 June 1992

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

zbMATH Keywords

pathscomplete binary tree\(n\)-dimensional cube3-dimensional gridcolor-pairharmonious coloring number

Mathematics Subject Classification ID

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

Related Items (11)

Harmonious coloring: parameterized algorithms and upper bounds ⋮ Harmonious Coloring: Parameterized Algorithms and Upper Bounds ⋮ The exact value of the harmonious chromatic number of a complete binary tree ⋮ Asymptotic behaviour of the observability of \(Q_ n\) ⋮ The Harmonious Chromatic Number of Almost All Trees ⋮ The Harmonious Chromatic Number of Bounded Degree Trees ⋮ The harmonious chromatic number of a complete binary and trinary tree ⋮ Three algorithms for graph locally harmonious colouring ⋮ The harmonious chromatic number of complete \(r\)-ary trees ⋮ Central Graph of Quadrilateral Snakes with Chromatic Number ⋮ On the achromatic number of hypercubes

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• On the Harmonious Coloring of Graphs
• The bichromaticity of cylinder graphs and torus graphs
• Bichromaticity of bipartite graphs
• On Additive Bases and Harmonious Graphs

This page was built for publication: The harmonious coloring number of a graph