Upper bounds for harmonious colorings

DOI10.1002/JGT.3190150606zbMATH Open0737.05049OpenAlexW2156785727MaRDI QIDQ3984469FDOQ3984469

Authors: Xinhua Luo, Colin McDiarmid 

Publication date: 27 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150606

Recommendations

• A new upper bound for the harmonious chromatic number
• Bounds for the harmonious chromatic number of a graph
• An upper bound for the harmonious chromatic number of a graph
• scientific article; zbMATH DE number 2104720

zbMATH Keywords

matchingharmonious coloring\(k\)-harmonious chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Acyclic coloring of graphs
• Title not available (Why is that?)

Cited In (8)

• The harmonious coloring number of a graph
• Bounds for the harmonious chromatic number of a graph
• On harmonious coloring of hypergraphs
• Title not available (Why is that?)
• On harmonious colorings of regular digraphs
• Fine-Grained Complexity of Rainbow Coloring and its Variants.
• A new upper bound for the harmonious chromatic number
• Fine-grained complexity of rainbow coloring and its variants

This page was built for publication: Upper bounds for harmonious colorings

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