Author:
Hajnal P�ter,Szegedy M�ri�
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. D. Angluin, andL. G. Valiant: Fast probabilistic algorithms for Hamiltonian circuits and matchings.Journal of Computer and System Sciences 19 (1979), 155?193.
2. B. Bollob�s:Extremal Graph theory, Academic Press, London, 1978.
3. B. Bollob�s:Random Graphs, Academic Press, London, 1985.
4. B. Bollob�s, andS. E. Eldridge: Packing of graphs and applications to computational complexity,J. of Combinatorial Theory Ser. B 25 (1978), 105?124.
5. D. Burns, andS. Schuster: Every (p, p-1) graph is contained in its complement.J. Graph Theory 1 (1977), 277?279.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Embedding Graphs into Larger Graphs: Results, Methods, and Problems;Bolyai Society Mathematical Studies;2019
2. On the bipartite graph packing problem;Discrete Applied Mathematics;2017-08
3. A list version of graph packing;Discrete Mathematics;2016-08
4. Embedding into Bipartite Graphs;SIAM Journal on Discrete Mathematics;2010-01
5. Testing Graph Isomorphism;SIAM Journal on Computing;2008-01