Pages that link to "Item:Q616002"
From MaRDI portal
The following pages link to Trees in greedy colorings of hypergraphs (Q616002):
Displaying 7 items.
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- A note on embedding hypertrees (Q1028812) (← links)
- Applications of hypergraph coloring to coloring graphs not inducing certain trees (Q1916109) (← links)
- On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Erdős-Hajnal problem for \(H\)-free hypergraphs (Q6144501) (← links)