Yuqin Zhang

activity

20212023

most citedOn Hadwiger's covering functional for the simplex and the cross-polytope

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

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2022

On Tomaszewski's Cube Vertices Problem

Yiming Li, Yuqin Zhang, Miao Fu

The following assertion was equivalent to a conjecture proposed by B. Tomaszewski : Let $C$ be an $n$ -dimensional unit cube and let $H$ be a plank of thickness $1$ , both are center…

math.CO2022

On the existence of tripartite graphs and n-partite graphs

Jiyun Guo, Miao Fu, Yuqin Zhang +1

The degree sequence of a graph is the sequence of the degrees of its vertices. If $π$ is a degree sequence of a graph $G$ , then $G$ is a realization of $π$ and $G$ realizes $π$ . De…

math.CO2022

Monochromatic vertex-disconnection of graphs

Miao Fu, Yuqin Zhang

Let G be a vertex-colored graph. A vertex cut S of G is called a monochromatic vertex cut if the vertices of S are colored with the same color. A graph G is monochromatically verte…

math.CO2021

Algorithm for monochromatic vertex-disconnection of graphs

Miao Fu, Yuqin Zhang

Let G be a vertex-colored graph. We call a vertex cut S of G a monochromatic vertex cut if the vertices of S are colored with the same color. The graph G is monochromatically verte…

math.CO2021

Optimal conditions for $(L_{1}; L_{2})$ to be forcibly bigraphic

Jiyun Guo, Yuqin Zhang

Let $L_{1} = ([a_{1}, b_{1}], \dots, [a_{m}, b_{m}])$ and $L_{2} = ([c_{1}, d_{1}], \dots, [c_{n}, d_{n}]$ ) be two sequences of intervals consisting of nonnegative integers with $b_{1} \geq \dots \geq b_{m}$ and $d_1\…

On Tomaszewski's Cube Vertices Problem

On the existence of tripartite graphs and n-partite graphs

Monochromatic vertex-disconnection of graphs

Algorithm for monochromatic vertex-disconnection of graphs

Optimal conditions for (L1​;L2​) to be forcibly bigraphic

Optimal conditions for $(L_{1}; L_{2})$ to be forcibly bigraphic