Erfang Shan

collaborators

Showing 2014Show all

2 papers · 1 filter

math.CO2014

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs

Erfang Shan, Yuxiao Sun, Liying Kang

A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $H (G)$ , of a…

math.CO2014

3-Factor-criticality in double domination edge critical graphs

Haichao Wang, Erfang Shan, Yancai Zhao

A vertex subset $S$ of a graph $G$ is a double dominating set of $G$ if $∣ N [v] \cap S ∣ \geq 2$ for each vertex $v$ of $G$ , where $N [v]$ is the set of the vertex $v$ and vertices adja…

Coloring clique-hypergraph of K5​-minor-free graphs

3-Factor-criticality in double domination edge critical graphs

Coloring clique-hypergraph of $K_{5}$ -minor-free graphs