Pages that link to "Item:Q963408"
From MaRDI portal
The following pages link to 1,2 conjecture-the multiplicative version (Q963408):
Displaying 12 items.
- The 1,2-conjecture for powers of cycles (Q324730) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Computation of lucky number of planar graphs is NP-hard (Q413250) (← links)
- Multiplicative vertex-colouring weightings of graphs (Q413281) (← links)
- Neighbor product distinguishing total colorings (Q512884) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- The neighbour-sum-distinguishing edge-colouring game (Q526242) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- A note on edge weightings inducing proper vertex colorings (Q1756095) (← links)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Neighbor product distinguishing total colorings of 2-degenerate graphs (Q2292128) (← links)