Hitting time of hamilton cycles in random bipartite graphs (1991)
Bollobás, Béla 
; Kohayakawa, Yoshiharu
Fonte: Proceedings. Nome do evento: International Conference in Graph Theory, Combinatorics, Algorithms and Applications. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. Hitting time of hamilton cycles in random bipartite graphs. 1991, Anais.. Philadelphia: SIAM, 1991. . Acesso em: 17 nov. 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 nov. 17 ]Vancouver
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 nov. 17 ]
