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.
- 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)
- 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)
- 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)
- 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)
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391) (← 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)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- Weight choosability of graphs with maximum degree 4 (Q2194741) (← links)
- On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← 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)
- On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- An improved upper bound on neighbor expanded sum distinguishing index (Q2282485) (← links)
- Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
- On the total-neighbor-distinguishing index by sums (Q2345540) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
- Vertex-coloring 3-edge-weighting of some graphs (Q2374171) (← links)
- The edge-labeling and vertex-colors of \(K_n\) (Q2391759) (← 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)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- Local antimagic labeling of graphs (Q2423101) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- A note on face coloring entire weightings of plane graphs (Q2450136) (← links)
