The following pages link to Nopparat Pleanmani (Q3178166):
Displaying 6 items.
- Bounds for the dichromatic number of a generalized lexicographic product of digraphs (Q3178167) (← links)
- Partially composed property of generalized lexicographic product graphs (Q4597965) (← links)
- A note on pebbling bound for a product of Class 0 graphs (Q5064377) (← links)
- Bounds for the pebbling number of product graphs (Q5104010) (← links)
- Graham’s pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph (Q5207502) (← links)
- Graham's Pebbling Conjecture Holds for the Product of a Graph and a Sufficiently Large Complete Graph (Q5213546) (← links)