Xinmin Hou

activity

20152026

K_{4}^{-}

-saturated graphs

5 citations · 17 across the 35 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Some exact results of the generalized Turán numbers for paths

Doudou Hei, Xinmin Hou, Boyuan Liu

For graphs $H$ and $F$ with chromatic number $χ (F) = k$ , we call $H$ strictly $F$ -Turán-good (or $(H, F)$ strictly Turán-good) if the Turán graph $T_{k - 1} (n)$ is the unique $F$ -free…

math.CO2021

Rainbow independent sets in graphs with maximum degree two

Yue Ma, Xinmin Hou, Jun Gao +2

Given a graph $G$ , let $f_{G} (n, m)$ be the minimal number $k$ such that every $k$ independent $n$ -sets in $G$ have a rainbow $m$ -set. Let $D (2)$ be the family of all grap…

math.CO2021

Strongly connected orientation with minimum lexicographic order of indegrees

Hongyu Zhou, Xinmin Hou

Given a simple undirected graph $G$ , an orientation of $G$ is to assign every edge of $G$ a direction. Borradaile et al gave a greedy algorithm SC-Path-Reversal (in polynomial time…