Weight choosability of oriented hypergraphs
From MaRDI portal
Publication:5225027
DOI10.26493/1855-3974.1317.745zbMATH Open1416.05243OpenAlexW2891053266WikidataQ129216297 ScholiaQ129216297MaRDI QIDQ5225027FDOQ5225027
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
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
Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Edge weights and vertex colours
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- The 1-2-3-conjecture for hypergraphs
- Combinatorial Nullstellensatz
- Total weight choosability of graphs
- Weight choosability of graphs
- Every graph is \((2,3)\)-choosable
- Digraphs are 2-weight choosable
- An oriented version of the 1-2-3 conjecture
- Coloring chip configurations on graphs and digraphs
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
Cited In (5)
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)
