The following pages link to Weight choosability of graphs (Q3608322):
Displaying 46 items.
- Total weight choosability of cone graphs (Q293660) (← links)
- Essential positive covers of the cube (Q385027) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← 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)
- An improved upper bound on edge weight choosability of graphs (Q497381) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Additive coloring of planar graphs (Q742621) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability (Q831336) (← links)
- Lucky labelings of graphs (Q989579) (← 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)
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring (Q1701100) (← links)
- Local antimagic orientations of \(d\)-degenerate graphs (Q1730236) (← 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)
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) (Q2062679) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
- Going wide with the 1-2-3 conjecture (Q2166211) (← links)
- Every nice graph is (1,5)-choosable (Q2171030) (← links)
- Weight choosability of graphs with maximum degree 4 (Q2194741) (← 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)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Total weight choosability of graphs with bounded maximum average degree (Q2397545) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- The 1-2-3-Conjecture for Hypergraphs (Q4978298) (← links)
- Weight choosability of oriented hypergraphs (Q5225027) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)
- A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS (Q5411805) (← links)
- Total weight choosability of graphs (Q5894172) (← 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)
