On harmonious coloring of hypergraphs

DOI10.46298/DMTCS.11101MaRDI QIDQ6606988zbMATH OpenFDO

Authors Sebastian Czerwiński

Publication date 17 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.11101

zbMATH Keywords

harmonious coloringhypergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Harmonious coloring of uniform hypergraphs
• Bounds for the harmonious chromatic number of a graph
• Upper bounds for harmonious colorings
• Harmonious and achromatic colorings of fragmentable hypergraphs
• A new upper bound for the harmonious chromatic number

Cites work

• Acyclic edge-coloring using entropy compression
• Bounds for the harmonious chromatic number of a graph
• Harmonious coloring of trees with large maximum degree
• Harmonious coloring of uniform hypergraphs
• scientific article; zbMATH DE number 140040 (Why is no real title available?)
• scientific article; zbMATH DE number 1057876 (Why is no real title available?)
• New approach to nonrepetitive sequences
• New bounds for the acyclic chromatic index
• New upper bounds on harmonious colorings
• On harmonious colouring of trees
• On the vertex-distinguishing proper edge-colorings of graphs
• The Harmonious Chromatic Number of Bounded Degree Graphs
• The Harmonious Chromatic Number of Bounded Degree Trees
• The local cut lemma
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Vertex-distinguishing edge colorings of graphs
• Vertex-distinguishing proper edge-colorings

This page was built for publication: On harmonious coloring of hypergraphs

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