3 citations · 3 across the 2 of their papers we have counts for
3 papers
math.CO2020
Beyond Hamiltonicity of Prime Difference Graphs
Hong-Bin Chen, Hung-Lin Fu, Jun-Yi Guo
A graph is Hamiltonian if it contains a cycle which visits every vertex of the graph exactly once. In this paper, we consider the problem of Hamiltonicity of a graph , which w…
math.CO2019★ 3 cited
The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets, and Chains
Hong-Bin Chen, Yen-Jen Cheng, Wei-Tian Li +1
Motivated by the paper of Axenovich and Walzer [2], we study the Ramsey-type problems on the Boolean lattices. Given posets and , we look for the smallest Boolean lattice $\…
math.CO2016
Families of Subsets Without a Given Poset in the Interval Chains
Jun-Yi Guo, Fei-Huang Chang, Hong-Bin Chen +1
For two posets and , we say is -free if there does not exist any order-preserving injection from to . The speical case for being the Boolean lattice …