Pages that link to "Item:Q4284107"
From MaRDI portal
The following pages link to Bounds for the harmonious chromatic number of a graph (Q4284107):
Displaying 13 items.
- Harmonious colourings of graphs (Q516809) (← links)
- On the harmonious chromatic number of a graph (Q1823253) (← links)
- On the harmonic index and the chromatic number of a graph (Q2444567) (← links)
- Harmonious coloring: parameterized algorithms and upper bounds (Q2632021) (← links)
- Some results concerning the \(p\)-Royden and \(p\)-harmonic boundaries of a graph of bounded degree (Q2908732) (← links)
- An upper bound for the harmonious chromatic number of a graph (Q3795694) (← links)
- Upper bounds for harmonious colorings (Q3984469) (← links)
- A new upper bound for the harmonious chromatic number (Q4242954) (← links)
- New upper bounds on harmonious colorings (Q4290578) (← 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)
- On harmonious coloring of hypergraphs (Q6606988) (← links)