Jian Song

Affiliations:

Durham University, School of Engineering and Computing Sciences, UK

According to our database¹, Jian Song authored at least 10 papers between 2010 and 2017.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2017

A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

2014

Closing complexity gaps for coloring problems on H-free graphs.

[BibT_eX]

[DOI]

Petr A. Golovach

Daniël Paulusma

Jian Song

Inf. Comput., 2014

Coloring graphs without short cycles and long induced paths.

[BibT_eX]

[DOI]

Petr A. Golovach

Daniël Paulusma

Jian Song

Discret. Appl. Math., 2014

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

[BibT_eX]

[DOI]

CoRR, 2014

2013

4-coloring H-free graphs when H is small.

[BibT_eX]

[DOI]

Petr A. Golovach

Daniël Paulusma

Jian Song

Discret. Appl. Math., 2013

2012

Computing vertex-surjective homomorphisms to partially reflexive trees.

[BibT_eX]

[DOI]

Petr A. Golovach

Daniël Paulusma

Jian Song

Theor. Comput. Sci., 2012

Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Updating the complexity status of coloring graphs without a fixed induced linear forest.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

2010

Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

On Coloring Graphs without Induced Forests.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Jian Song

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...