The following pages link to Jian Song (Q417994):
Displaying 13 items.
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- 4-Coloring H-Free Graphs When H Is Small (Q2891376) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613) (← links)
- On Coloring Graphs without Induced Forests (Q3060770) (← links)
- Coloring Graphs without Short Cycles and Long Induced Paths (Q3088283) (← links)
- Closing Complexity Gaps for Coloring Problems on H-Free Graphs (Q4909517) (← links)
