5 citations · 12 across the 9 of their papers we have counts for
14 papers
Coloring (, kite)-free graphs
Shenwei Huang, Yiao Ju, T. Karthick
Let and denote the induced path and complete graph on vertices, respectively. The {\em kite} is the graph obtained from a by adding a vertex and making it adj…
Short proofs on -extendible graphs
Shenwei Huang, Yongtang Shi
In this note, we give short inductive proofs of two known results on -extendible graphs based on a property proved in [Qinglin Yu, A note on -extendable graphs. Journal of Gr…
Some Results on -Critical -Free Graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
A graph is -vertex-critical if has chromatic number but every proper induced subgraph of has chromatic number less than . The study of -vertex-critical gra…
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 (, diamond)-free if it contains no induced subgraph isomorphic to a six…
Some extremal results on the chromatic-stability index
Shenwei Huang, Sandi Klavžar, Hui Lei +2
The -stability index of a graph is the minimum number of its edges whose removal results in a graph with the chromatic number smaller than that of . In th…
-Critical Graphs in -Free Graphs
Kathie Cameron, Jan Goedgebeur, Shenwei Huang +1
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let be the path on vertices. A graph $G…