Jing-Ho Yan

activity

20092022

collaborators

5 papers

math.CO2022

On the Turán number of $K_{m} \lor C_{2 k - 1}$

Jingru Yan

Given a graph $H$ and a positive integer $n$ , the Turán number of $H$ for the order $n$ , denoted $e x (n, H)$ , is the maximum size of a simple graph of order $n$ not containing $H$ as…

math.CO2022

Estimating the circumference of a graph in terms of its leaf number

Jingru Yan

Let $T$ be the set of spanning trees of $G$ and let $L (T)$ be the number of leaves in a tree $T$ . The leaf number $L (G)$ of $G$ is defined as $L(G)=\max\{L(T)|T\in \mathc…

math.CO2021

Isolation of the diamond graph

Jingru Yan

A graph is $H$ -free if it does not contain $H$ as a subgraph. The diamond graph is the graph obtained from $K_{4}$ by deleting one edge. We prove that if $G$ is a connected graph wit…

math.CO2020

The Turán number of book graphs

Jingru Yan, Xingzhi Zhan

Given a graph $H$ and a positive integer $n,$ the Turán number of $H$ for the order $n,$ denoted $ex (n, H),$ is the maximum size of a simple graph of order $n$ not containing…

math.CO2009

Equitable coloring of interval graphs and products of graphs

Bor-Liang Chen, Ko-Wei Lih, Jing-Ho Yan

We confirm the equitable $Δ$ -coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable color…

On the Turán number of Km​∨C2k−1​

Estimating the circumference of a graph in terms of its leaf number

Isolation of the diamond graph

The Turán number of book graphs

Equitable coloring of interval graphs and products of graphs

On the Turán number of $K_{m} \lor C_{2 k - 1}$