The following pages link to (Q4740588):
Displayed 15 items.
- Harmonious coloring of trees with large maximum degree (Q418860) (← links)
- Harmonious colourings of graphs (Q516809) (← links)
- The harmonious chromatic number of a complete binary and trinary tree (Q685580) (← links)
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581) (← links)
- The complexity of harmonious colouring for trees (Q1346692) (← links)
- The exact value of the harmonious chromatic number of a complete binary tree (Q1366782) (← links)
- Asymptotic behaviour of the observability of \(Q_ n\) (Q1377684) (← links)
- On the harmonious chromatic number of a graph (Q1823253) (← links)
- Graphs which have \(n/2\)-minimal line-distinguishing colourings (Q1923477) (← links)
- Some constructions of $\lambda$-minimal graphs (Q4324011) (← links)
- Strongly set-colorable graphs (Q4621304) (← links)
- (Q4886768) (← links)
- RECURSIVE AXIOMATISATIONS FROM SEPARATION PROPERTIES (Q5015731) (← links)
- The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs (Q5054038) (← links)
- (Q5708601) (← links)