Pages that link to "Item:Q845661"
From MaRDI portal
The following pages link to Acyclic colorings of products of trees (Q845661):
Displaying 9 items.
- The 2-distance coloring of the Cartesian product of cycles using optimal Lee codes (Q765320) (← links)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- Game coloring the Cartesian product of graphs (Q3605153) (← links)
- On irreducible no‐hole <i>L</i>(2, 1)‐coloring of trees (Q5191141) (← links)
- Game chromatic number of Cartesian product graphs (Q5900078) (← links)
- A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
- A note on acyclic coloring of strong product of graphs (Q6571585) (← links)
- Coloring of graphs avoiding bicolored paths of a fixed length (Q6604665) (← links)
