The following pages link to (Q3514492):
Displaying 7 items.
- Graphs with vertex-coloring and detectable 2-edge-weighting (Q334127) (← links)
- The plurality problem with three colors and more. (Q557833) (← links)
- Method of 3-colouring of graphs (Q1123201) (← links)
- A note on the three color problem (Q1805376) (← links)
- Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
- A code for disconnected edge-colored graphs (Q2844267) (← links)
- Recognizable colorings of graphs (Q3527525) (← links)