Nopparat Pleanmani

According to our database, Nopparat Pleanmani authored at least 3 papers between 2016 and 2019.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of six.

2019

Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph.

Nopparat Pleanmani

Discret. Math. Algorithms Appl., 2019

2017

Partially composed property of generalized lexicographic product graphs.

Nopparat Pleanmani, Boyko Gyurov, Sayan Panma

Discret. Math. Algorithms Appl., 2017

2016

Bounds for the dichromatic number of a generalized lexicographic product of digraphs.

Nopparat Pleanmani, Sayan Panma

Discret. Math. Algorithms Appl., 2016