Pages that link to "Item:Q647275"

The following pages link to Vertex-coloring edge-weightings of graphs (Q647275):

Displaying 36 items.

• Graphs with vertex-coloring and detectable 2-edge-weighting (Q334127) (← links)
• Total weight choosability of Cartesian product of graphs (Q449198) (← 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)
• Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
• On vertex-coloring 13-edge-weighting (Q1001315) (← links)
• A new type of edge-derived vertex coloring (Q1045165) (← links)
• A note on edge weightings inducing proper vertex colorings (Q1756095) (← links)
• Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
• Edge weights and vertex colours (Q1826962) (← links)
• On total weight choosability of graphs (Q1956254) (← links)
• On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) (Q2062679) (← links)
• On proper labellings of graphs with minimum label sum (Q2118389) (← links)
• Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
• Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
• On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
• On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
• Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
• Vertex coloring edge-weighted digraphs (Q2348711) (← links)
• An injective version of the 1-2-3 conjecture (Q2657086) (← links)
• The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
• On the role of 3's for the 1-2-3 conjecture (Q2692720) (← links)
• (Q3115650) (← links)
• Edge Coloring and Decompositions of Weighted Graphs (Q3541103) (← links)
• Total weight choosability for Halin graphs (Q4958040) (← links)
• On Proper Labellings of Graphs with Minimum Label Sum (Q5041179) (← links)
• A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← links)
• (Q5086032) (← links)
• (Q5164968) (← links)
• (Q5267501) (← links)
• Vertex-coloring graphs with 4-edge-weightings (Q6081387) (← links)
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
• A notion of vertex equitability for proper labellings (Q6153474) (← links)
• A solution to the 1-2-3 conjecture (Q6196158) (← links)
• Adding direction constraints to the 1-2-3 conjecture (Q6652479) (← links)