Xin Xu

collaborators

4 papers

math.CO2025

Degree-truncated choosability of planar graphs

Yiting Jiang, Huijuan Xu, Xinbo Xu +1

Assume $G$ is a graph and $k$ is a positive integer. Let $f : V (G) \to N$ be defined as $f (v) = min {k, d_{G} (v)}$ . If $G$ is $f$ -choosable, then we say $G$ is degree-truncated…

math.CO2024

The planar TurÃ¡n number of double star $S_{2, 4}$

Xin Xu, Jiawei Shao

Planar TurÃ¡n number $e x_{P} (n, H)$ of $H$ is the maximum number of edges in an $n$ -vertex planar graph which does not contain $H$ as a subgraph. Ghosh, GyÅri, Paulos and…

math.CO2024

Planar TurÃ¡n number for balanced double stars

Xin Xu, Qiang Zhou, Tong Li +1

Planar TurÃ¡n number, denoted by $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex planar graph which does not contain $H$ as a subgraph. Ghosh, GyÅri, Paul…

math.CO2024

An improved upper bound for planar TurÃ¡n number of double star $S_{2, 5}$

Xin Xu, Yue Hu, Xu Zhang

The planar TurÃ¡n number of a graph $H$ , denoted by $e x_{P} (n, H)$ , is the maximum number of edges in an $n$ -vertex $H$ -free planar graph. Recently, D. Ghosh, et al. initi…

Degree-truncated choosability of planar graphs

The planar TurÃ¡n number of double star S2,4​

Planar TurÃ¡n number for balanced double stars

An improved upper bound for planar TurÃ¡n number of double star S2,5​

The planar TurÃ¡n number of double star $S_{2, 4}$

An improved upper bound for planar TurÃ¡n number of double star $S_{2, 5}$