Yan Yang

activity

20122022

most citedUpper bounds on the signed edge domination number of a graph

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

collaborators

Showing 2012 · math.COShow all

2 papers · 2 filters

math.CO2012

The thickness of cartesian product $K_{n} □ P_{m}$

Yan Yang

The thickness $θ (G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. It is a topological invariant of a graph, which w…

math.CO2012★ 1 cited

The thickness of amalgamations of graphs

Yan Yang, Xiangheng Kong

The thickness $θ (G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a me…

The thickness of cartesian product Kn​□Pm​

The thickness of amalgamations of graphs

The thickness of cartesian product $K_{n} □ P_{m}$