Bounding the weight choosability number of a graph

zbMath1302.05059arXiv1210.6944MaRDI QIDQ2928589

Ben Seamone

Publication date: 10 November 2014

Full work available at URL: https://arxiv.org/abs/1210.6944

zbMATH Keywords

permanentsgraph colouringgraph labellingcombinatorial nullstellensatz1-2-3 conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (17)

Graphs are \((1, \varDelta + 1)\)-choosable ⋮ Neighbor sum distinguishing total choosability of planar graphs without 4-cycles ⋮ Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability ⋮ Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture ⋮ A relaxed case on 1-2-3 conjecture ⋮ Decomposing graphs into a constant number of locally irregular subgraphs ⋮ Every nice graph is (1,5)-choosable ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ List neighbor sum distinguishing edge coloring of subcubic graphs ⋮ Forcing \(k\)-repetitions in degree sequences ⋮ A note on a directed version of the 1-2-3 conjecture ⋮ Weight choosability of graphs with maximum degree 4 ⋮ A solution to the 1-2-3 conjecture ⋮ Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring ⋮ The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs

This page was built for publication: Bounding the weight choosability number of a graph