Total weight choosability of graphs with bounded maximum average degree
From MaRDI portal
Publication:2397545
DOI10.1016/J.DISC.2016.10.002zbMATH Open1362.05057OpenAlexW2555688599MaRDI QIDQ2397545FDOQ2397545
Authors: Yunfang Tang, Xuding Zhu 
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
Recommendations
- On weight choosabilities of graphs with bounded maximum average degree
- On total weight choosability of graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
- Improper choosability of graphs and maximum average degree
- Weight choosability of graphs
- Total list weighting of graphs with bounded maximum average degree
- Weight choosability of graphs with maximum degree 4
- Total weight choosability of Mycielski graphs
Cites Work
- On vertex-coloring 13-edge-weighting
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex colouring edge partitions
- Combinatorial Nullstellensatz
- Total weight choosability of graphs
- Total weight choosability of graphs
- On total weight choosability of graphs
- Total weight choosability of cone graphs
- List total weighting of graphs
- Weight choosability of graphs
- Total weight choosability of Cartesian product of graphs
- Permanent index of matrices associated with graphs
- Every graph is \((2,3)\)-choosable
- Colorings and orientations of graphs
- Total Weight Choosability of Trees
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
- On weight choosabilities of graphs with bounded maximum average degree
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
Cited In (8)
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
- Graphs are \((1, \varDelta + 1)\)-choosable
- Every nice graph is (1,5)-choosable
- Total weight choosability of Cartesian product of graphs
- Total weight choosability of Mycielski graphs
- Dense Eulerian graphs are \((1, 3)\)-choosable
- Total list weighting of graphs with bounded maximum average degree
- On total weight choosability of graphs
This page was built for publication: Total weight choosability of graphs with bounded maximum average degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397545)
