The 1-2-3-Conjecture for Hypergraphs

DOI10.1002/jgt.22100zbMath1367.05151arXiv1308.0611OpenAlexW2962946498WikidataQ123126385 ScholiaQ123126385MaRDI QIDQ4978298

Michał Karoński, Maciej Kalkowski, Florian Pfender

Publication date: 8 August 2017

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

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

zbMATH Keywords

irregular hypergraph labelings

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex degrees (05C07) Signed and weighted graphs (05C22)

Related Items (7)

Going wide with the 1-2-3 conjecture ⋮ 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 ⋮ A lower bound and several exact results on the \(d\)-lucky number ⋮ Weight choosability of oriented hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• Weight choosability of graphs
• The Even Cycle Problem for Directed Graphs
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: The 1-2-3-Conjecture for Hypergraphs