5 papers
Exact values of rainbow Turán numbers for fan graphs and even wheel graphs
Xinmin Hou, Daoguang Xiong
An edge-colored graph is called rainbow if all its edges have distinct colors. For a fixed graph , the rainbow Turán number $\exstar(n, H)$ is the maximum number of edges in a…
Every connected subcubic graph except the Petersen graph is packing -colorable
Xinmin Hou, Xujun Liu, Xiangyang Wang
For a non-decreasing sequence of positive integers, a packing -coloring of a graph is a partition of into such t…
An improvement bound on a problem of Picasarri-Arrieta and Rambaud
Bin Chen, Xinmin Hou, Yue Ma +2
Let and be positive integers. A cycle with two blocks is a digraph consisting of two internally vertex disjoint directed paths of lengths and with…
Paths with two blocks in oriented graphs of large minimum semi-degree
Bin Chen, Xinmin Hou, Xinyu Zhou
Stein (2020) conjectured that for any positive integer , every oriented graph of minimum semi-degree greater than contains every oriented path of length . This conjectu…
The generalized Turán number for K_3 in graphs without suspensions of a path on five vertices
Doudou Hei, Xinmin Hou, Yue Ma
Given graphs and , the generalized Turán number $\ex(n, H, F)$ is defined as the maximum number of copies of in an -vertex graph that contains no copy of . The su…