The largest tree in a random graph
- 31 May 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 23 (3) , 273-286
- https://doi.org/10.1016/0304-3975(83)90034-8
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph ProblemsJournal of the ACM, 1979
- Cliques in random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1976
- Hamiltonian circuits in random graphsDiscrete Mathematics, 1976
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975