Sebastián Bustamante - Google Učenjak

Ustvarite profil

Navedeno

	Vse	Od leta 2019
Navedbe	20	15
indeks h	2	2
indeks i10	1	0

0

4

2

201720182019202020212022202320241 1 1 2 3 4 4 1

Soavtorji

Maya SteinUniversity of ChilePreverjeni e-poštni naslov na dim.uchile.cl
Hiep HanUniversity of Santiago, ChilePreverjeni e-poštni naslov na usach.cl

Sebastián Bustamante

Sebastián Bustamante

University of Chile

Preverjeni e-poštni naslov na dim.uchile.cl

Graph Theory Combinatorics


Naslov Razvrsti po navedbah Razvrsti po letniku Razvrsti po naslovu	Navedeno Navedeno	Leto
Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles S Bustamante, H Han, M Stein arXiv preprint arXiv:1701.07806, 2017	12	2017
Monochromatic tree covers and Ramsey numbers for set-coloured graphs S Bustamante, M Stein Discrete Mathematics 341 (1), 266-276, 2018	6	2018
Partitioning 2-coloured complete k-uniform hypergraphs into monochromatic ℓ-cycles S Bustamante, M Stein European Journal of Combinatorics 71, 213-221, 2018	2	2018
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles S Bustamante, H Hàn, M Stein Electronic Notes in Discrete Mathematics 61, 185-190, 2017		2017

Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.

Članki 1–4