Binlong Li

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Characterizing forbidden pairs for spanning $Θ$ -subgraphs of 2-connected graphs

Binlong Li, Ziqing Sang, Shipeng Wang

Let $F$ be a set of connected graphs, and let $G$ be a graph. We say that $G$ is \emph{ $F$ -free} if it does not contain $F$ as an induced subgraph for all $F\in…

math.CO2025

On graphs without cycles of length 1 modulo 3

Yandong Bai, Binlong Li, Yufeng Pan +1

Burr and ErdÅs conjectured in 1976 that for every two integers $k > ℓ ⩾ 0$ satisfying that $k Z + ℓ$ contains an even integer, an $n$ -vertex graph containing no c…

math.CO2024

Closures and heavy pairs for hamiltonicity

Wangyi Shang, Hajo Broersma, Shenggui Zhang +1

We say that a graph $G$ on $n$ vertices is ${H, F}$ - $o$ -heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least…

Characterizing forbidden pairs for spanning Θ-subgraphs of 2-connected graphs

On graphs without cycles of length 1 modulo 3

Closures and heavy pairs for hamiltonicity

Characterizing forbidden pairs for spanning $Θ$ -subgraphs of 2-connected graphs