Pages that link to "Item:Q2216732"
From MaRDI portal
The following pages link to Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732):
Displaying 17 items.
- The \(n\)-queens completion problem (Q2157925) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- Rainbow factors in hypergraphs (Q2299634) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Pseudorandom hypergraph matchings (Q4993112) (← links)
- Tree decompositions of graphs without large bipartite holes (Q5120745) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- (Q5147550) (← links)
- Repeated Patterns in Proper Colorings (Q5157390) (← links)
- Packing Paths in Steiner Triple Systems (Q5194624) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
- The novel generally described graphs for cyclic orthogonal double covers of some circulants (Q6059285) (← links)
- Perfectly packing graphs with bounded degeneracy and many leaves (Q6165180) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
