Hitting time of hamilton cycles in random bipartite graphs (1991)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Publisher: SIAM
- Publisher place: Philadelphia
- Date published: 1991
- Source:
- Título do periódico: Proceedings
- Conference titles: International Conference in Graph Theory, Combinatorics, Algorithms and Applications
-
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. Hitting time of hamilton cycles in random bipartite graphs. 1991, Anais.. Philadelphia: SIAM, 1991. . Acesso em: 19 abr. 2024. -
APA
Bollobás, B., & Kohayakawa, Y. (1991). Hitting time of hamilton cycles in random bipartite graphs. In Proceedings. Philadelphia: SIAM. -
NLM
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 abr. 19 ] -
Vancouver
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 abr. 19 ] - A practical minimal perfect hashing method
- Evolution of random subgraphs of the cube
- On Richardson's model on the hypercube
- The Turan theorem for random graphs
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- Universality and tolerance
- Hereditary properties of triple systems
- An optimal algorithm for checking regularity
- Searching in Random partially ordered sets
- Discrepancy and eigenvalues of Cayley graphs
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
