Pages that link to "Item:Q1001315"

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

Displaying 36 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 2-edge-weighting of graphs (Q607360) (← 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)
• Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
• Every nice graph is (1,5)-choosable (Q2171030) (← links)
• The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
• Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
• On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← 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)
• Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
• A note on face coloring entire weightings of plane graphs (Q2450136) (← 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)
• On the standard \((2,2)\)-conjecture (Q2662793) (← links)
• Total weight choosability for Halin graphs (Q4958040) (← links)
• On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
• A solution to the 1-2-3 conjecture (Q6196158) (← links)