The following pages link to Edge weights and vertex colours (Q1826962):
Displaying 50 items.
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- On vertex-coloring 13-edge-weighting (Q1001315) (← links)
- Edge irregular total labellings for graphs of linear size (Q1043545) (← links)
- A new type of edge-derived vertex coloring (Q1045165) (← 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)
- Multi-set neighbor distinguishing 3-edge coloring (Q1690251) (← links)
- A note on a directed version of the 1-2-3 conjecture (Q1693177) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring (Q1701100) (← links)
- On offset Hamilton cycles in random hypergraphs (Q1701116) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs (Q1730218) (← links)
- Local antimagic orientations of \(d\)-degenerate graphs (Q1730236) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- A note on edge weightings inducing proper vertex colorings (Q1756095) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- On total weight choosability of graphs (Q1956254) (← links)
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs (Q2008185) (← links)
- Note on the group edge irregularity strength of graphs (Q2009255) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
- Total weight choosability of graphs: towards the 1-2-3-conjecture (Q2033917) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) (Q2062679) (← links)
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391) (← links)
- On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
- Graph classes with locally irregular chromatic index at most 4 (Q2095566) (← links)
- On proper labellings of graphs with minimum label sum (Q2118389) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- Neighbour-distinguishing labellings of families of graphs (Q2141099) (← 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)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- Local antimagic orientation of graphs (Q2175055) (← links)
- Additive list coloring of planar graphs with given girth (Q2175242) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
