Minimal harmoniously colorable designs

DOI10.1002/JCD.3180020203MaRDI QIDQ4764646zbMATH OpenOpenAlexFDO

Authors

Publication date 30 May 1995

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.3180020203

zbMATH Keywords

bipartite graphcoloringcombinatorial designHadamard designHadamard matrixharmonious designsminimal harmonious coloringminimally harmonious designssymmetric design

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Harmonious colouring of graphs
• scientific article; zbMATH DE number 125470
• The harmonious coloring number of a graph
• Harmonious colourings of graphs

Cited in

(1)

• Distance-regular graphs, MH-colourings and MLD-colourings

This page was built for publication: Minimal harmoniously colorable designs

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