Total weight choosability of graphs with bounded maximum average degree
From MaRDI portal
Publication:2397545
DOI10.1016/j.disc.2016.10.002zbMath1362.05057OpenAlexW2555688599MaRDI QIDQ2397545
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.10.002
Related Items (2)
Total list weighting of graphs with bounded maximum average degree ⋮ Every nice graph is (1,5)-choosable
Cites Work
- Unnamed Item
- Total weight choosability of cone graphs
- 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
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- Colorings and orientations of graphs
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- Edge weights and vertex colours
- On total weight choosability of graphs
- Vertex-colouring edge-weightings
- Vertex colouring edge partitions
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- Total Weight Choosability of Trees
- Total weight choosability of graphs
- Total weight choosability of graphs
This page was built for publication: Total weight choosability of graphs with bounded maximum average degree
