Author:
Bollobás Béla,Kostochka Alexandr,Nakprasit Kittikorn
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference12 articles.
1. Embedding arbitrary graphs of maximal degree two;Aigner;J. London Math. Soc. (2),1993
2. 2-factors in dense graphs;Alon;Discrete Math.,1996
3. Extremal Graph Theory;Bollobás,1978
4. Maximal matchings in graphs with given maximal and minimal degrees;Bollobás;Congr. Numer.,1976
5. Packing of graphs and applications to computational complexity;Bollobás;J. Combin. Theory Ser. B,1978
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Generalization of the Graph Packing Theorems of Sauer-Spencer and Brandt;Combinatorica;2022-10-10
2. Packing a number of copies of a (p,q)-graph;Discrete Applied Mathematics;2021-01
3. A blow-up lemma for approximate decompositions;Transactions of the American Mathematical Society;2018-12-21
4. Packing Graphs of Bounded Codegree;Combinatorics, Probability and Computing;2018-03-22
5. Packing two graphs of even girth 10;Electronic Notes in Discrete Mathematics;2017-08