research
∙
08/12/2021
Some Results on k-Critical P_5-Free Graphs
A graph G is k-vertex-critical if G has chromatic number k but every pro...
share
research
∙
06/16/2021
Colouring graphs with no induced six-vertex path or diamond
The diamond is the graph obtained by removing an edge from the complete ...
research
∙
05/04/2020
Complexity of C_k-coloring in hereditary classes of graphs
For a graph F, a graph G is F-free if it does not contain an induced sub...
research
∙
07/05/2019
A Pvalue-guided Anomaly Detection Approach Combining Multiple Heterogeneous Log Parser Algorithms on IIoT Systems
Industrial Internet of Things (IIoT) is becoming an attack target of adv...
research
∙
03/27/2019
On graphs with no induced five-vertex path or paraglider
Given two graphs H_1 and H_2, a graph is (H_1, H_2)-free if it contains ...
research
∙
09/03/2018
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...
research
∙
05/21/2018
Colouring Square-Free Graphs without Long Induced Paths
The complexity of Colouring is fully understood for H-free graphs, but ...
research
∙
09/27/2017
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...
research
∙
12/20/2016