Yiao Ju

collaborators

2 papers

math.CO2022

Coloring ( $P_{5}$ , kite)-free graphs

Shenwei Huang, Yiao Ju, T. Karthick

Let $P_{n}$ and $K_{n}$ denote the induced path and complete graph on $n$ vertices, respectively. The {\em kite} is the graph obtained from a $P_{4}$ by adding a vertex and making it adj…

math.CO2021

Colouring graphs with no induced six-vertex path or diamond

Jan Goedgebeur, Shenwei Huang, Yiao Ju +1

The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is ( $P_{6}$ , diamond)-free if it contains no induced subgraph isomorphic to a six…

Coloring (P5​, kite)-free graphs

Colouring graphs with no induced six-vertex path or diamond

Coloring ( $P_{5}$ , kite)-free graphs