Pages that link to "Item:Q965260"
From MaRDI portal
The following pages link to Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260):
Displaying 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Group sum chromatic number of graphs (Q268265) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- On decomposing graphs of large minimum degree into locally irregular subgraphs (Q286116) (← 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)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- Decomposing graphs into a constant number of locally irregular subgraphs (Q338587) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
- Colour-blind can distinguish colour pallets (Q405211) (← links)
- Multiplicative vertex-colouring weightings of graphs (Q413281) (← 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)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- An improved upper bound on edge weight choosability of graphs (Q497381) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- A note on neighbor expanded sum distinguishing index (Q505462) (← 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)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- On a directed variation of the 1-2-3 and 1-2 conjectures (Q516801) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- The neighbour-sum-distinguishing edge-colouring game (Q526242) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- The sigma chromatic number of a graph (Q607685) (← links)
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Additive coloring of planar graphs (Q742621) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
- New bounds for locally irregular chromatic index of bipartite and subcubic graphs (Q1631691) (← links)
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
- Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
- Neighbor sum distinguishing index of 2-degenerate graphs (Q1680491) (← links)
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- Graph coloring and Graham's greatest common divisor problem (Q1690244) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
