The following pages link to (Q5026930):
Displaying 5 items.
- Bounds on graph compositions and the connection to the Bell triangle (Q906495) (← links)
- Bell and Stirling numbers for graphs (Q3550089) (← links)
- Emerging applications, models and algorithms in combinatorial optimization (Q6041825) (← links)
- Upper bounds on the average number of colors in the non-equivalent colorings of a graph (Q6045131) (← links)
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph (Q6046133) (← links)