Pages that link to "Item:Q1001315"

The following pages link to On vertex-coloring 13-edge-weighting (Q1001315):

Displaying 16 items.

• A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
• Group sum chromatic number of graphs (Q268265) (← links)
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← 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)
• Total weight choosability of Mycielski graphs (Q512875) (← links)
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
• Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
• A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
• Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
• Colourings of graphs by labellings (Q1687834) (← links)
• On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
• On offset Hamilton cycles in random hypergraphs (Q1701116) (← links)
• Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← 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)