331 citations
- University of Chinese Academy of SciencesCN253 papers
- Tsinghua UniversityCN243 papers
- University of ManchesterGB241 papers
- University of OxfordGB240 papers
- Istituto Nazionale di Fisica Nucleare, Laboratori Nazionali di FrascatiIT239 papers
- Uppsala UniversitySE238 papers
- Zhengzhou UniversityCN217 papers
- Peking UniversityCN213 papers
- Nanjing UniversityCN209 papers
- University of Science and Technology of ChinaCN208 papers
- Shandong UniversityCN205 papers
- Shanghai Jiao Tong UniversityCN203 papers
5 papers · 2 filters
Strongly light subgraphs in the 1-planar graphs with minimum degree 7
Tao Wang
A graph is {\em -planar} if it can be drawn in the plane such that every edge crosses at most one other edge. A connected graph is {\em strongly light} in a family of graphs…
Strong chromatic index of k-degenerate graphs
Tao Wang
A {\em strong edge coloring} of a graph is a proper edge coloring in which every color class is an induced matching. The {\em strong chromatic index} $\chiup_{s}'(G)$ of a grap…
On the diameter of total domination vertex critical graphs
Tao Wang
In this paper, we consider various types of domination vertex critical graphs, including total domination vertex critical graphs, independent domination vertex critical graphs and…
Acyclic edge coloring of graphs
Tao Wang, Yaqiong Zhang
An {\em acyclic edge coloring} of a graph is a proper edge coloring such that the subgraph induced by any two color classes is a linear forest (an acyclic graph with maximum de…
Long properly colored cycles in edge colored complete graphs
Guanghui Wang, Tao Wang, Guizhen Liu
Let denote a complete graph on vertices whose edges are colored in an arbitrary way. Let denote the maximum number of edges of the sa…