research
∙
08/02/2023
Balanced-chromatic number and Hadwiger-like conjectures
Motivated by different characterizations of planar graphs and the 4-Colo...
share
research
∙
07/31/2023
Boundedness for proper conflict-free and odd colorings
The proper conflict-free chromatic number, χ_pcf(G), of a graph G is the...
research
∙
06/03/2023
Subchromatic numbers of powers of graphs with excluded minors
A k-subcolouring of a graph G is a function f:V(G) →{0,…,k-1} such that ...
research
∙
02/15/2022
The treewidth and pathwidth of graph unions
For two graphs G_1 and G_2 on the same vertex set [n]:={1,2, …, n}, and ...
research
∙
12/18/2018
