Hitting time of hamilton cycles in random bipartite graphs
Béla Bollobás Yoshiharu Kohayakawa; International Conference in GraphTheory, Combinatorics, Algorithms and Applications (2. : 1989 : San Francisco, Califórnia, US)
Proceedings Philadelphia : Siam, 1991
Philadelphia SIAM 1991
Localização:
IME - Inst. Matemática e Estatística
(QA845.C I61g 2. ) e outros locais(Acessar)
Estimating the distance to a hereditary graph property
Carlos Hoppen Yoshiharu Kohayakawa; Richard Lang; Hanno Lefmann; Henrique Stagni; European Conference on Combinatorics, GraphTheory and Applications - EUROCOMB'17 (2017 Vienna)
Electronic Notes in Discrete Mathematics Amsterdam v. 61, p. 607-613, 2017
Amsterdam Elsevier 2017
Localização:
IME - Inst. Matemática e Estatística
(PROD-2844603 )(Acessar)
Peter Allen Julia Bottcher; Barnaby Roberts; Yoshiharu Kohayakawa; European Conference on Combinatorics, GraphTheory and Applications - EuroComb (8th 2015 Bergen)
Electronic Notes in Discrete Mathematics Amsterdam v. 49. p. 393-397, Nov. 2015
Amsterdam 2015
Localização:
IME - Inst. Matemática e Estatística
(PROD-2736939 )(Acessar)
Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number
Carlos Hoppen Yoshiharu Kohayakawa; Hanno Lefmann; European Conference on Combinatorics, GraphTheory and Applications - EuroComb (6. 2011 Budapest, Hungary)
Electronic Notes in Discrete Mathematics Amsterdam v. 38, p. 469-474, 2011
Amsterdam 2011
Localização:
IME - Inst. Matemática e Estatística
(PROD-3035611 )(Acessar)