Zobrazeno 1 - 10
of 173
pro vyhledávání: '"Huang, Shenwei"'
Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. A graph $G$ is $k$-vertex-critical if every proper induced subgraph of $G$ has chromatic number less than $k$, but $G$ has
Externí odkaz:
http://arxiv.org/abs/2403.05611
Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ nor $H_2$. Let $P_t$ be the path on $t$ vertices. A dart is the graph obtained from a diamond by adding a new vertex and making it ad
Externí odkaz:
http://arxiv.org/abs/2308.03414
Autor:
Ju, Yiao, Huang, Shenwei
In this paper, we initiate a systematic study on a new notion called near optimal colourability which is closely related to perfect graphs and the Lov{\'a}sz theta function. A graph family $\mathcal{G}$ is {\em near optimal colourable} if there is a
Externí odkaz:
http://arxiv.org/abs/2303.18003
Autor:
Huang, Shenwei, Li, Zeyu
Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. A $P_t$ is the path on $t$ vertices. A chair is a $P_4$ with an additional vertex adjacent to one of the middle vertice
Externí odkaz:
http://arxiv.org/abs/2301.02436
Autor:
Huang, Shenwei
In this paper, we give an optimal $\chi$-binding function for the class of $(P_7,C_4,C_5)$-free graphs. We show that every $(P_7,C_4,C_5)$-free graph $G$ has $\chi(G)\le \lceil \frac{11}{9}\omega(G) \rceil$. To prove the result, we use a decompositio
Externí odkaz:
http://arxiv.org/abs/2212.05239
Given two graphs $H_1$ and $H_2$, a graph is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ and $C_t$ be the path and the cycle on $t$ vertices, respectively. A bull is the graph obtained from a triangle w
Externí odkaz:
http://arxiv.org/abs/2211.04179
Let $P_n$ and $K_n$ denote the induced path and complete graph on $n$ vertices, respectively. The {\em kite} is the graph obtained from a $P_4$ by adding a vertex and making it adjacent to all vertices in the $P_4$ except one vertex with degree 1. A
Externí odkaz:
http://arxiv.org/abs/2204.08631
Publikováno v:
In North American Journal of Economics and Finance September 2024 74
Autor:
Huang, Shenwei, Shi, Yongtang
In this note, we give short inductive proofs of two known results on $k$-extendible graphs based on a property proved in [Qinglin Yu, A note on $n$-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].
Comment: 5 pages
Comment: 5 pages
Externí odkaz:
http://arxiv.org/abs/2110.03483