Total weight choosability of graphs with bounded maximum average degree

DOI10.1016/J.DISC.2016.10.002MaRDI QIDQ2397545zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

matrixpermanentcombinatorial Nullstellensatztotal weight choosability

Mathematics Subject Classification ID

Vertex degrees (05C07) Signed and weighted graphs (05C22)

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

• Colorings and orientations of graphs
• Combinatorial Nullstellensatz
• Edge weights and vertex colours
• Every graph is \((2,3)\)-choosable
• Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
• List total weighting of graphs
• On total weight choosability of graphs
• On vertex-coloring 13-edge-weighting
• On weight choosabilities of graphs with bounded maximum average degree
• Permanent index of matrices associated with graphs
• The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
• Total Weight Choosability of Trees
• Total weight choosability of Cartesian product of graphs
• Total weight choosability of cone graphs
• Total weight choosability of graphs
• Total weight choosability of graphs
• Vertex colouring edge partitions
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Vertex-colouring edge-weightings
• Weight choosability of graphs

Cited in

(8)

• Every nice graph is (1,5)-choosable
• Total weight choosability of Cartesian product of graphs
• Total list weighting of graphs with bounded maximum average degree
• Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
• Dense Eulerian graphs are \((1, 3)\)-choosable
• Total weight choosability of Mycielski graphs
• Graphs are \((1, \varDelta + 1)\)-choosable
• 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)