Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs

zbMath1339.05269arXiv1511.04569MaRDI QIDQ2629488

Andrzej Dudek, Laars Helenius, Patrick Bennett, Alan M. Frieze

Publication date: 6 July 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.04569

zbMATH Keywords

\(r\)-uniform hypergraphstrongly weighted hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (10)

Going wide with the 1-2-3 conjecture ⋮ On the semi-proper orientations of graphs ⋮ On the total versions of 1-2-3-conjecture for graphs and hypergraphs ⋮ A solution to the 1-2-3 conjecture ⋮ On offset Hamilton cycles in random hypergraphs ⋮ From the 1-2-3 conjecture to the Riemann hypothesis ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Weight choosability of oriented hypergraphs ⋮ The 1-2-3-Conjecture for Hypergraphs

Cites Work

• Algorithmic complexity of proper labeling problems
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• The Difference Between Consecutive Primes, II
• Packing hamilton cycles in random and pseudo-random hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs