Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 articles.
1. Graph functionality;Alecu;J. Comb. Theory, Ser. B,2021
2. Optimal induced universal graphs and adjacency labeling for trees;Alstrup;J. ACM,2017
3. The speed of hereditary properties of graphs;Balogh;J. Comb. Theory, Ser. B,2000
4. Optimal labelling schemes for adjacency, comparability, and reachability;Bonamy,2021
5. Twin-width II: small classes;Bonnet,2021
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. No Complete Problem for Constant-Cost Randomized Communication;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10