Harmonious and achromatic colorings of fragmentable hypergraphs

DOI10.1016/j.ejc.2017.06.013zbMath1369.05072OpenAlexW2741051677WikidataQ62595896 ScholiaQ62595896MaRDI QIDQ5920082

Michał Dębski, Zbigniew Lonc, Paweł Rzążewski

Publication date: 11 September 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://zenodo.org/record/895793

zbMATH Keywords

\(k\)-uniform hypergraphharmonious coloring

Mathematics Subject Classification ID

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

Related Items (4)

Sequences of radius \(k\) for complete bipartite graphs ⋮ Facial achromatic number of triangulations on the sphere ⋮ Complete colourings of hypergraphs ⋮ The existence of uniform hypergraphs for which the interpolation property of complete coloring fails

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Achromatic number of collections of paths and cycles
• Sparsity. Graphs, structures, and algorithms
• The existence of \(k\)-radius sequences
• Coloring face hypergraphs on surfaces
• Asymptotic behavior of the chromatic index for hypergraphs
• Colorings of planar graphs with no rainbow faces
• Near perfect coverings in graphs and hypergraphs
• Universal cycles for combinatorial structures
• Coloring face-hypergraphs of graphs on surfaces
• Achromatic number of fragmentable graphs
• Near-Universal Cycles for Subsets Exist
• New upper bounds on harmonious colorings
• Vertex-distinguishing proper edge-colorings
• Detachments of Complete Graphs
• The Harmonious Chromatic Number of Bounded Degree Graphs
• Harmonious coloring of uniform hypergraphs

This page was built for publication: Harmonious and achromatic colorings of fragmentable hypergraphs