Pages that link to "Item:Q4290578"
From MaRDI portal
The following pages link to New upper bounds on harmonious colorings (Q4290578):
Displaying 13 items.
- Harmonious colourings of graphs (Q516809) (← links)
- The complexity of harmonious colouring for trees (Q1346692) (← links)
- Fragmentability of graphs (Q1850531) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- Achromatic number of fragmentable graphs (Q3055929) (← links)
- Dismantling Sparse Random Graphs (Q3512603) (← links)
- Achromatic and Harmonious Colorings of Circulant Graphs (Q4604012) (← links)
- The Harmonious Chromatic Number of Almost All Trees (Q4844488) (← links)
- The Harmonious Chromatic Number of Bounded Degree Trees (Q4883059) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5890910) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5920082) (← links)
