7 citations · 8 across the 15 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Sufficient conditions on cycles that make planar graphs 4-choosable
Pongpat Sittitrai, Kittikorn Nakprasit
Xu and Wu proved that if every -cycle of a planar graph is not simultaneously adjacent to -cycles and -cycles, then is -choosable. In this paper, we improve thi…
math.CO2017
Some conditions on 5-cycles that make planar graphs 4-choosable
Pongpat Sittitrai, Kittikorn Nakprasit
Consider two conditions on a graph: (1) each 5-cycle is not a subgraph of 5-wheel and does not share exactly one edge with 3-cycle, and (2) each 5-cycle is not adjacent to two 3-cy…