Weight choosability of oriented hypergraphs
From MaRDI portal
Publication:5225027
DOI10.26493/1855-3974.1317.745zbMath1416.05243OpenAlexW2891053266WikidataQ129216297 ScholiaQ129216297MaRDI QIDQ5225027
Jarosław Grytczuk, Marcin Anholcer, Bartłomiej Bosek
Publication date: 25 July 2019
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1317.745
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Every graph is \((2,3)\)-choosable
- Digraphs are 2-weight choosable
- Coloring chip configurations on graphs and digraphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Edge weights and vertex colours
- An oriented version of the 1-2-3 conjecture
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- The 1-2-3-Conjecture for Hypergraphs
- Total weight choosability of graphs
This page was built for publication: Weight choosability of oriented hypergraphs
