The following pages link to Edge weights and vertex colours (Q1826962):
Displaying 50 items.
- 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)
- On colour-blind distinguishing colour pallets in regular graphs (Q2251135) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← 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)
- A lower bound and several exact results on the \(d\)-lucky number (Q2284776) (← 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)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- Total edge irregularity strength of accordion graphs (Q2410103) (← links)
- A note on breaking small automorphisms in graphs (Q2410241) (← links)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- The complexity of the proper orientation number (Q2445254) (← links)
- A note on face coloring entire weightings of plane graphs (Q2450136) (← links)
- Degree constrained subgraphs (Q2482112) (← links)
- Vertex colouring edge partitions (Q2485946) (← links)
- On twin edge colorings of graphs (Q2509550) (← links)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← links)
- An injective version of the 1-2-3 conjecture (Q2657086) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- On the semi-proper orientations of graphs (Q2663989) (← links)
- The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
- On the role of 3's for the 1-2-3 conjecture (Q2692720) (← links)
- Asymptotically optimal neighbour sum distinguishing colourings of graphs (Q3460519) (← links)
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- On locally irregular decompositions of subcubic graphs (Q4561210) (← links)
- (Q4581902) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- The 1-2-3-Conjecture for Hypergraphs (Q4978298) (← links)
