Pages that link to "Item:Q413281"
From MaRDI portal
The following pages link to Multiplicative vertex-colouring weightings of graphs (Q413281):
Displayed 10 items.
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Gap vertex-distinguishing edge colorings of graphs (Q456892) (← links)
- Neighbor product distinguishing total colorings (Q512884) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- Neighbor product distinguishing total colorings of 2-degenerate graphs (Q2292128) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- Product irregularity strength of graphs with small clique cover number (Q5045247) (← links)
- A proof of the multiplicative 1-2-3 conjecture (Q6102259) (← links)