Ke Liu

most citedTreewidth of the generalized Kneser graphs

1 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2021

Treewidth of the $q$ -Kneser graphs

Mengyu Cao, Ke Liu, Mei Lu +1

Let $V$ be an $n$ -dimensional vector space over a finite field $F_{q}$ , where $q$ is a prime power. Define the \emph{generalized $q$ -Kneser graph} $K_{q} (n, k, t)$ to be the gra…

math.CO2021

$w$ -Dominating Set Problem on Graphs of Bounded Treewidth

Ke Liu, Mei Lu

Let $G = (V, E)$ be a graph. Let $w$ be a positive integer. A $w$ -dominating set is a vertex subset $S$ such that for all $v \in V$ , either $v \in S$ or it has at least $w$ neighbors in…

math.CO2020★ 1 cited

Treewidth of the generalized Kneser graphs

Ke Liu, Mengyu Cao, Mei Lu

Let $n$ , $k$ and $t$ be integers with $1 \leq t < k \leq n$ . The \emph{generalized Kneser graph} $K (n, k, t)$ is a graph whose vertices are the $k$ -subsets of a fixed $n$ -set, where tw…

math.CO2020★ 1 cited

The treewidth of 2-section of hypergraphs

Ke Liu, Mei Lu

Let $H = (V, F)$ be a simple hypergraph without loops. $H$ is called linear if $∣ f \cap g ∣ \leq 1$ for any $f, g \in F$ with $f \neq = g$ . The $2$ -section of $H$ , denoted by $[H]_{2}$ , is a gra…

Treewidth of the q-Kneser graphs

w-Dominating Set Problem on Graphs of Bounded Treewidth

Treewidth of the generalized Kneser graphs

The treewidth of 2-section of hypergraphs

Treewidth of the $q$ -Kneser graphs

$w$ -Dominating Set Problem on Graphs of Bounded Treewidth