Total weight choosability of graphs
Summary: Suppose the edges and the vertices of a simple graph \(G\) are assigned \(k\)-element lists of real weights. By choosing a representative of each list, we specify a vertex colouring, where for each vertex its colour is defined as the sum of the weights of its incident edges and the weight of the vertex itself. How long lists ensures a choice implying a proper vertex colouring for any graph? Is there any finite bound or maybe already lists of length two are sufficient? We prove that 2-element lists are enough for trees, wheels, unicyclic and complete graphs, while the ones of length 3 are sufficient for complete bipartite graphs. Our main tool is an algebraic theorem by Alon called Combinatorial Nullstellensatz.
- Graphs are \((1, \varDelta + 1)\)-choosable
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- Distant total irregularity strength of graphs via random vertex ordering
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- On total weight choosability of graphs
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- Dense Eulerian graphs are (1, 3)-choosable
- Every nice graph is (1,5)-choosable
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
- The 1-2-3 conjecture almost holds for regular graphs
- From the 1-2-3 conjecture to the Riemann hypothesis
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- Total weight choosability of graphs with bounded maximum average degree
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- On the standard (2,2)-conjecture
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
- Bounding the monomial index and (1,l)-weight choosability of a graph
- Total weight choosability of cone graphs
- List total weighting of graphs
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- Neighbor sum distinguishing total choosability of planar graphs
- Weight choosability of graphs
- Neighbor sum distinguishing index of planar graphs
- Total weight choosability of Cartesian product of graphs
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Total weight choosability for Halin graphs
- The 1-2-3-conjecture for hypergraphs
- Neighbor sum distinguishing total colorings of planar graphs
- Permanent index of matrices associated with graphs
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Total weight choosability of Mycielski graphs
- On weight choosabilities of graphs with bounded maximum average degree
- Every graph is (2,3)-choosable
- Weight choosability of oriented hypergraphs
- Total Weight Choosability of Trees
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- A solution to the 1-2-3 conjecture
- Digraphs are 2-weight choosable
- The 1-2 conjecture holds for regular graphs
- Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 15
- The 1-2-3 conjecture holds for graphs with large enough minimum degree
- Total list weighting of Cartesian product of graphs
- On the permanent indices of graphs
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
- On the neighbor sum distinguishing total coloring of planar graphs
This page was built for publication: Total weight choosability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892521)
