Xinmin Hou

activity

20182026

collaborators

Showing 2026Show all

4 papers · 1 filter

math.CO2026

Oriented paths with two blocks in bipartite oriented graphs

Bin Chen, Meishuang Chen, Xinmin Hou +1

Stein conjectured that for any integer $k \geq 2$ , every oriented graph with minimum semidegree greater than $k /2$ contains every orientation of a path with $k$ edges. Recently, Che…

math.CO2026

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 $H$ , the rainbow Turán number $\exstar(n, H)$ is the maximum number of edges in a p…

math.CO2026

Every connected subcubic graph except the Petersen graph is packing $(1, 1, 2, 2)$ -colorable

Xinmin Hou, Xujun Liu, Xiangyang Wang

For a non-decreasing sequence $S = (s_{1}, s_{2}, \dots, s_{k})$ of positive integers, a packing $S$ -coloring of a graph $G$ is a partition of $V (G)$ into $V_{1}, V_{2}, \dots, V_{k}$ such t…

math.CO2026

An improvement bound on a problem of Picasarri-Arrieta and Rambaud

Bin Chen, Xinmin Hou, Yue Ma +2

Let $k$ and $ℓ$ be positive integers. A cycle with two blocks $C (k, ℓ)$ is a digraph consisting of two internally vertex disjoint directed paths of lengths $k$ and $ℓ$ with…

Oriented paths with two blocks in bipartite oriented graphs

Exact values of rainbow Turán numbers for fan graphs and even wheel graphs

Every connected subcubic graph except the Petersen graph is packing (1,1,2,2)-colorable

An improvement bound on a problem of Picasarri-Arrieta and Rambaud

Every connected subcubic graph except the Petersen graph is packing $(1, 1, 2, 2)$ -colorable