Pages that link to "Item:Q5894172"

The following pages link to Total weight choosability of graphs (Q5894172):

Displaying 42 items.

• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
• Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
• Total weight choosability of cone graphs (Q293660) (← links)
• A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles (Q306111) (← links)
• Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
• Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
• Total weight choosability of Cartesian product of graphs (Q449198) (← links)
• The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
• Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
• Permanent index of matrices associated with graphs (Q510339) (← links)
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
• Total weight choosability of Mycielski graphs (Q512875) (← links)
• On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
• Every graph is \((2,3)\)-choosable (Q519997) (← links)
• On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
• Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
• Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
• Total list weighting of graphs with bounded maximum average degree (Q1660242) (← links)
• Distant total irregularity strength of graphs via random vertex ordering (Q1699557) (← links)
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring (Q1701100) (← links)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• Neighbor sum distinguishing list total coloring of subcubic graphs (Q1743484) (← links)
• On total weight choosability of graphs (Q1956254) (← links)
• Total weight choosability of graphs: towards the 1-2-3-conjecture (Q2033917) (← links)
• Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
• Every nice graph is (1,5)-choosable (Q2171030) (← links)
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
• The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
• From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
• 2-connected chordal graphs and line graphs are \((1,5)\)-choosable (Q2225433) (← links)
• Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
• Total weight choosability of graphs with bounded maximum average degree (Q2397545) (← links)
• Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
• On the standard \((2,2)\)-conjecture (Q2662793) (← links)
• Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
• Total weight choosability for Halin graphs (Q4958040) (← links)
• The 1-2-3-Conjecture for Hypergraphs (Q4978298) (← links)
• Total Weight Choosability of Trees (Q5346547) (← links)
• Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
• A solution to the 1-2-3 conjecture (Q6196158) (← links)