Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Zhi Yee Chng"'
Publikováno v:
Discrete Mathematics. 344:112440
Given two simple graphs G and H, the Ramsey number R ( G , H ) is the smallest integer n such that for any graph of order n, either it contains G or its complement contains H. Let T n be a tree graph of order n and W s , m be the generalised wheel gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c428dc0ea57d4aad78c767ab52c8fb9
https://doi.org/10.1016/j.disc.2021.112440
https://doi.org/10.1016/j.disc.2021.112440
