Wannapol Pimpasalee

According to our database, Wannapol Pimpasalee authored at least 6 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Planar Graphs Without 4-Cycles Are (6, 6)-Colorable.

Pongpat Sittitrai, Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit

Symmetry, 2025

2024

Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable.

Pongpat Sittitrai, Wannapol Pimpasalee

Int. J. Math. Math. Sci., 2024

Planar graphs without 4- and 6-cycles are (3,4)-colorable.

Kittikorn Nakprasit, Pongpat Sittitrai, Wannapol Pimpasalee

Discret. Appl. Math., 2024

2021

Planar graphs without specific cycles are 2-degenerate.

Patcharapan Jumnongnit, Wannapol Pimpasalee

Discret. Math., 2021

2018

On list backbone coloring of graphs.

Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit

Ars Comb., 2018

2016

List backbone coloring of paths and cycles.

Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit

Australas. J Comb., 2016