The Harmonious Chromatic Number of Bounded Degree Graphs

DOI10.1112/S0024610797004857zbMATH Open0869.05033MaRDI QIDQ4716669FDOQ4716669

Authors: Keith Edwards 

Publication date: 12 December 1996

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Recommendations

• Bounds for the harmonious chromatic number of a graph
• scientific article; zbMATH DE number 125470
• The Harmonious Chromatic Number of Bounded Degree Trees
• An upper bound for the harmonious chromatic number of a graph
• A new upper bound for the harmonious chromatic number

zbMATH Keywords

maximum degreeharmonious chromatic numberharmonious colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (21)

• Some results concerning the \(p\)-Royden and \(p\)-harmonic boundaries of a graph of bounded degree
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Graphs of bounded degree and the \(p\)-harmonic boundary
• Harmonious coloring of trees with large maximum degree
• On harmonious colouring of trees
• Bounds for the harmonious chromatic number of a graph
• On the harmonious chromatic number of a graph
• Achromatic and harmonious colorings of circulant graphs
• On harmonious coloring of hypergraphs
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Title not available (Why is that?)
• Harmonious colouring of graphs
• Complete colourings of hypergraphs
• The growth rate of the harmonious chromatic number
• Degree constrained subgraphs
• Title not available (Why is that?)
• An upper bound for the harmonious chromatic number of a graph
• Vertex colouring edge partitions
• On harmonious colouring of \(C(W_n)\) and \(C(F_{m,n})\)
• The Harmonious Chromatic Number of Almost All Trees
• Title not available (Why is that?)

This page was built for publication: The Harmonious Chromatic Number of Bounded Degree Graphs

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