Total weight choosability of graphs
From MaRDI portal
Publication:5892521
zbMath1217.05202MaRDI QIDQ5892521
Jakub Przybyło, Mariusz Woźniak
Publication date: 1 June 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/232266
Related Items (38)
Graphs are \((1, \varDelta + 1)\)-choosable ⋮ 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 ⋮ Total weight choosability of cone graphs ⋮ A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Every nice graph is (1,5)-choosable ⋮ On the standard \((2,2)\)-conjecture ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Total Weight Choosability of Trees ⋮ Neighbor sum distinguishing index of planar graphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ A solution to the 1-2-3 conjecture ⋮ 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 ⋮ 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 via the combinatorial nullstellensatz ⋮ 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 ⋮ Total weight choosability of graphs: towards the 1-2-3-conjecture ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Total weight choosability for Halin graphs ⋮ Weight choosability of oriented hypergraphs ⋮ The 1-2-3-Conjecture for Hypergraphs ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs
This page was built for publication: Total weight choosability of graphs
