Total weight choosability of graphs
From MaRDI portal
Publication:5894172
DOI10.1002/jgt.20500zbMath1228.05161arXiv1510.00809OpenAlexW1964459877MaRDI QIDQ5894172
Publication date: 21 March 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.00809
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)
Related Items (42)
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 ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Total list weighting of graphs with bounded maximum average degree ⋮ 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 ⋮ Total weight choosability of Cartesian product 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 ⋮ The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse 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 ⋮ Neighbor sum distinguishing list total coloring of subcubic 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 ⋮ The 1-2-3-Conjecture for Hypergraphs ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs
Cites Work
This page was built for publication: Total weight choosability of graphs
