Jian Song

Publication Activity (10 Years)

Years Active: 2010-2017
Publications (10 Years): 1

Top Topics

Graph Theoretic

Computational Complexity

Reachability Queries

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs. J. Graph Theory 84 (4) (2017)
Petr A. Golovach, Daniël Paulusma, Jian Song
Coloring graphs without short cycles and long induced paths. Discret. Appl. Math. 167 (2014)
Petr A. Golovach, Daniël Paulusma, Jian Song
Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. 237 (2014)
Petr A. Golovach, Matthew Johnson, Daniël Paulusma, Jian Song
A Survey on the Computational Complexity of Colouring Graphs with Forbidden Subgraphs. CoRR (2014)
Petr A. Golovach, Daniël Paulusma, Jian Song
4-coloring H-free graphs when H is small. Discret. Appl. Math. 161 (1-2) (2013)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
-free graphs in polynomial time. Theor. Comput. Sci. 423 (2012)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414 (1) (2012)
Petr A. Golovach, Daniël Paulusma, Jian Song
4-Coloring H-Free Graphs When H Is Small. SOFSEM (2012)
Petr A. Golovach, Daniël Paulusma, Jian Song
Computing vertex-surjective homomorphisms to partially reflexive trees. Theor. Comput. Sci. 457 (2012)
Petr A. Golovach, Daniël Paulusma, Jian Song
Closing Complexity Gaps for Coloring Problems on H-Free Graphs. ISAAC (2012)
Petr A. Golovach, Daniël Paulusma, Jian Song
Coloring Graphs without Short Cycles and Long Induced Paths. FCT (2011)
Petr A. Golovach, Daniël Paulusma, Jian Song
Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees. CSR (2011)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
-Free Graphs. WG (2010)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
On Coloring Graphs without Induced Forests. ISAAC (2) (2010)