8 citations · 11 across the 6 of their papers we have counts for
6 papers
Near Optimal Colourability on Hereditary Graph Families
Yiao Ju, Shenwei Huang
In this paper, we initiate a systematic study on a new notion called near optimal colourability which is closely related to perfect graphs and the Lov{á}sz theta function. A graph…
Vertex-Critical -Free Graphs
Shenwei Huang, Zeyu Li
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . A is the path on vertices. A chair is a…
Critical (,bull)-free graphs
Shenwei Huang, Jiawei Li, Wen Xia
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path and the cycle on …
Computational Complexity of Testing Proportional Justified Representation
Haris Aziz, Shenwei Huang
We consider a committee voting setting in which each voter approves of a subset of candidates and based on the approvals, a target number of candidates are selected. Aziz et al. (2…
Structure and algorithms for (cap, even hole)-free graphs
Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang +1
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with…
Narrowing the Complexity Gap for Colouring (,)-Free Graphs
Shenwei Huang, Matthew Johnson, Daniël Paulusma
For a positive integer and graph , a -colouring of is a mapping such that whenever . The -Colourin…