Pages that link to "Item:Q5128748"
From MaRDI portal
The following pages link to Almost all trees are almost graceful (Q5128748):
Displaying 11 items.
- Counting graceful labelings of trees: a theoretical and empirical study (Q897585) (← links)
- Embedding rainbow trees with applications to graph labelling and decomposition (Q2216732) (← links)
- A proof of Ringel's conjecture (Q2232153) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- Packing degenerate graphs (Q2324574) (← links)
- (Q3974978) (← links)
- Bipartite labeling of trees with maximum degree three (Q4242730) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- (Q5147550) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Graph and hypergraph packing (Q6198635) (← links)