Weight choosability of oriented hypergraphs

DOI10.26493/1855-3974.1317.745MaRDI QIDQ5225027zbMATH OpenOpenAlexWikidataFDO

Authors Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk

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

zbMATH Keywords

1-2-3 conjecturecombinatorial Nullstellensatzoriented hypergraphslist weighting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Weight choosability of graphs
• On total weight choosability of graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• Total weight choosability for Halin graphs
• A note on edge weight choosability of graphs
• Total weight choosability of cone graphs
• On weighted modulo orientation of graphs
• Regularity in weighted oriented graphs
• Orientability of random hypergraphs and the power of multiple choices

Cites work

• An oriented version of the 1-2-3 conjecture
• Coloring chip configurations on graphs and digraphs
• Combinatorial Nullstellensatz
• Digraphs are 2-weight choosable
• Edge weights and vertex colours
• Every graph is \((2,3)\)-choosable
• The 1-2-3-conjecture for hypergraphs
• Total weight choosability of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• Weight choosability of graphs

Cited in

(5)

• Unmixedness of some weighted oriented graphs
• On an ordering problem in weighted hypergraphs
• An oriented version of the 1-2-3 conjecture
• Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
• The 1-2-3-conjecture for hypergraphs

This page was built for publication: Weight choosability of oriented hypergraphs

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