
Some Results on kCritical P_5Free Graphs
A graph G is kvertexcritical if G has chromatic number k but every pro...
read it

Colouring graphs with no induced sixvertex path or diamond
The diamond is the graph obtained by removing an edge from the complete ...
read it

Complexity of C_kcoloring in hereditary classes of graphs
For a graph F, a graph G is Ffree if it does not contain an induced sub...
read it

A Pvalueguided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems
Industrial Internet of Things (IIoT) is becoming an attack target of adv...
read it

On graphs with no induced fivevertex path or paraglider
Given two graphs H_1 and H_2, a graph is (H_1, H_2)free if it contains ...
read it

An Optimal χBound for (P_6, diamond)Free Graphs
Given two graphs H_1 and H_2, a graph G is (H_1,H_2)free if it contains...
read it

Colouring SquareFree Graphs without Long Induced Paths
The complexity of Colouring is fully understood for Hfree graphs, but ...
read it

Linearly χBounding (P_6,C_4)Free Graphs
Given two graphs H_1 and H_2, a graph G is (H_1,H_2)free if it contains...
read it

Computational Complexity of Testing Proportional Justified Representation
We consider a committee voting setting in which each voter approves of a...
read it
Shenwei Huang
is this you? claim profile