2 citations · 4 across the 5 of their papers we have counts for
5 papers
A Ramsey Type problem for highly connected subgraphs
Chunlok Lo, Hehui Wu, Qiqin Xie
Bollobás and Gyárfás conjectured that for any with , every 2-edge-coloring of the complete graph on vertices leads to a -connected monoch…
A half-integral Erdős-Pósa theorem for directed odd cycles
Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon +1
We prove that there exists a function such that every directed graph contains either directed odd cycles where every vertex of is c…
4-Separations in Hajós Graphs
Qiqin Xie, Shijie Xie, Xiaofan Yuan +1
As a natural extension of the Four Color Theorem, Hajós conjectured that graphs containing no -subdivision are 4-colorable. Any possible counterexample to this conjecture with…
Wheels in planar graphs and Hajós graphs
Qiqin Xie, Shijie Xie, Xingxing Yu +1
It was conjectured by Hajós that graphs containing no -subdivision are 4-colorable. Previous results show that any possible minimum counterexample to Hajós' conjecture, called…
Induced Forests in Bipartite Planar Graphs
Yan Wang, Qiqin Xie, Xingxing Yu
Akiyama and Watanabe conjectured that every simple planar bipartite graph on vertices contains an induced forest on at least vertices. We apply the discharging method to…