34 results on '"Kittipassorn, Teeradej"'
Search Results
2. Union vertex-distinguishing edge colorings
3. Multithreshold multipartite graphs with small parts
4. Multithreshold multipartite graphs with small parts
5. Monochromatic Edges in Complete Multipartite Hypergraphs
6. On the Existence of Zero-Sum Perfect Matchings of Complete Graphs
7. The graph grabbing game on blow-ups of trees and cycles
8. A strategy for Isolator in the Toucher-Isolator game on trees
9. Union vertex-distinguishing edge colorings
10. Long cycles in Hamiltonian graphs
11. A Strategy for Isolator in the Toucher–Isolator Game on Trees
12. Partite Saturation of Complete Graphs
13. Generalised Majority Colourings of Digraphs
14. Frustrated Triangles
15. Disjoint induced subgraphs of the same order and size
16. Separating path systems
17. Approximations to $m$-coloured complete infinite hypergraphs
18. A canonical Ramsey theorem for exactly $m$-coloured complete subgraphs
19. Long cycles in Hamiltonian graphs
20. THE GRAPH GRABBING GAME ON BLOW-UPS OF TREES AND CYCLES.
21. On the existence of zero-sum perfect matchings of complete graphs
22. Disjoint induced subgraphs of the same order and size
23. Monochromatic Edges in Complete Multipartite Hypergraphs
24. A Strategy for Isolator in the Toucher–Isolator Game on Trees
25. The graph grabbing game on blow-ups of trees and cycles
26. Partite Saturation of Complete Graphs
27. Long cycles in Hamiltonian graphs
28. Generalized Majority Colourings of Digraphs
29. Frustrated triangles
30. Approximations tom-Colored Complete Infinite Hypergraphs
31. Separating path systems
32. A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs
33. Approximations to m-Colored Complete Infinite Hypergraphs.
34. A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.