2 papers
math.CO2019
Planar graphs with girth at least 5 are (3,4)-colorable
Ilkyoo Choi, Gexin Yu, Xia Zhang
A graph is -colorable if its vertex set can be partitioned into nonempty subsets so that the subgraph induced by the th part has maximum degree at most $…
math.CO2018
A bound on judicious bipartitions of directed graphs
Jianfeng Hou, Huawen Ma, Xingxing Yu +1
Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously, which have received a lot of attentions lately. Scott asked the following…