Graph theory and combinatorics, 1988 : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős

@inproceedings{Erds1984GraphTA,
  title={Graph theory and combinatorics, 1988 : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős},
  author={Paul Erdős and B{\'e}la Bollob{\'a}s},
  year={1984}
}
Preface (B. Bollobas). Paul Erdos at Seventy-Five (B. Bollobas). Packing Smaller Graphs into a Graph (J. Akiyama, F. Nakada, S. Tokunaga). The Star Arboricity of Graphs (I. Algor, N. Alon). Graphs with a Small Number of Distinct Induced Subgraphs (N. Alon, B. Bollobas). Extensions of Networks with Given Diameter (J.-C. Bermond, K. Berrada, J. Bond). Confluence of Some Presentations Associated with Graphs (N. Biggs). Long Cycles in Graphs with No Subgraphs of Minimal Degree 3 (B. Bollobas, G… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

Computational Human Dynamics

VIEW 1 EXCERPT
CITES BACKGROUND

Recent advances and open challenges in percolation

Nuno Araújo, P. Grassberger, Byungik Kahng, K.J. Schrenk, R.M. Ziff
  • 2014
VIEW 1 EXCERPT
CITES BACKGROUND