New upper bounds on harmonious colorings
From MaRDI portal
Publication:4290578
DOI10.1002/jgt.3190180305zbMath0796.05039OpenAlexW2087167825MaRDI QIDQ4290578
Keith J. Edwards, Colin J. H. McDiarmid
Publication date: 15 September 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180305
treeupper boundslower boundgenusplanar graphharmonious chromatic numbermaximum degreeharmonious coloring
Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
The complexity of harmonious colouring for trees ⋮ The Harmonious Chromatic Number of Almost All Trees ⋮ Planarization and fragmentability of some classes of graphs ⋮ Dismantling Sparse Random Graphs ⋮ Achromatic and Harmonious Colorings of Circulant Graphs ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ The Harmonious Chromatic Number of Bounded Degree Trees ⋮ Harmonious and achromatic colorings of fragmentable hypergraphs ⋮ Harmonious colourings of graphs ⋮ Achromatic number of fragmentable graphs ⋮ Upward three-dimensional grid drawings of graphs ⋮ On the \(k\)-component independence number of a tree ⋮ Fragmentability of graphs
This page was built for publication: New upper bounds on harmonious colorings
