The following pages link to On harmonious colouring of trees (Q426747):
Displaying 11 items.
- Harmonious coloring of trees with large maximum degree (Q418860) (← links)
- Harmonious colourings of graphs (Q516809) (← links)
- Minimally colored trees (Q908876) (← links)
- The complexity of harmonious colouring for trees (Q1346692) (← links)
- Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
- On the harmonious colouring of trees. (Q2829068) (← links)
- Harmonious Coloring: Parameterized Algorithms and Upper Bounds (Q3181062) (← links)
- The Harmonious Chromatic Number of Almost All Trees (Q4844488) (← links)
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs (Q5054038) (← links)
- (Q5503325) (← links)
- On harmonious coloring of hypergraphs (Q6606988) (← links)