Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
From MaRDI portal
Publication:1660241
DOI10.1016/j.disc.2018.06.036zbMath1393.05231OpenAlexW2884237156MaRDI QIDQ1660241
Yu-Chang Liang, Tsai-Lien Wong, Xuding Zhu
Publication date: 15 August 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.06.036
1-2-3 conjecturecombinatorial Nullstellensatzmaximum average degreetotal weighting\((k, k^\prime)\)-choosable graphs
Related Items
On a list variant of the multiplicative 1-2-3 conjecture ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Every nice graph is (1,5)-choosable
Cites Work
- Unnamed Item
- Unnamed Item
- Total weight choosability of Cartesian product of graphs
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
- Permanent index of matrices associated with graphs
- On weight choosabilities of graphs with bounded maximum average degree
- Every graph is \((2,3)\)-choosable
- A nowhere-zero point in linear mappings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- Colorings and orientations of graphs
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Vertex colouring edge partitions
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- Total weight choosability of graphs
- Total weight choosability of graphs
