Jiangli Song

most citedA Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs

25 citations · 26 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CC2014★ 25 cited

A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs

Petr A. Golovach, Matthew Johnson, Daniël Paulusma +1

For a positive integer $k$ , a $k$ -colouring of a graph $G = (V, E)$ is a mapping $c : V \to {1, 2, ..., k}$ such that $c (u) \neq = c (v)$ whenever $uv \in E$ . The Colouring problem is…

math.CO2013★ 1 cited

The $(k, ℓ)$ -rainbow index for complete bipartite and multipartite graphs

Qingqiong Cai, Xueliang Li, Jiangli Song

A tree in an edge-colored graph $G$ is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$ , $ℓ$ with $k \geq 3$ , the \emph…

math.CO2013

New skew Laplacian energy of a simple digraph

Qingqiong Cai, Xueliang Li, Jiangli Song

For a simple digraph $G$ of order $n$ with vertex set ${v_{1}, v_{2}, \dots, v_{n}}$ , let $d_{i}^{+}$ and $d_{i}^{-}$ denote the out-degree and in-degree of a vertex $v_{i}$ in $G$ , respectively.…

A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs

The (k,ℓ)-rainbow index for complete bipartite and multipartite graphs

New skew Laplacian energy of a simple digraph

The $(k, ℓ)$ -rainbow index for complete bipartite and multipartite graphs