Tao-Ming Wang

most citedMatching and Factor-Critical Property in 3-Dominating-Critical Graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2009★ 2 cited

Matching and Factor-Critical Property in 3-Dominating-Critical Graphs

Tao Wang, Qinglin Yu

Let $γ (G)$ be the domination number of a graph $G$ . A graph $G$ is \emph{domination-vertex-critical}, or \emph{ $γ$ -vertex-critical}, if $γ (G - v) < γ (G)$ for every vertex $v \in V (G)$ …

math.CO2008

On Intersection Representations and Clique Partitions of Graphs

Tao-Ming Wang, Jun-Lin Kuo

A multifamily set representation of a finite simple graph $G$ is a multifamily $F$ of sets (not necessarily distinct) for which each set represents a vertex in $G$ and tw…

math.CO2008

On Greedy Clique Decompositions and Set Representations of Graphs

Tao-Ming Wang, Jun-Lin Kuo

In 1994 S. McGuinness showed that any greedy clique decompo- sition of an n-vertex graph has at most $⌊ n^{2} /4 ⌋$ cliques (The greedy clique decomposition of a graph, J.…