50 results on '"Thomas, Robin"'
Search Results
2. On 2-cycles of graphs
3. Packing cycles in undirected group-labelled graphs
4. Packing A-paths of length zero modulo a prime
5. Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
6. Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs
7. Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
8. Three-coloring triangle-free graphs on surfaces III. Graphs of girth five
9. Excluded minors in cubic graphs
10. K6 minors in 6-connected graphs of bounded tree-width
11. Excluding subdivisions of bounded degree graphs
12. Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk
13. Non-embeddable extensions of embedded minors
14. K6 minors in large 6-connected graphs
15. A new proof of the flat wall theorem
16. Five-list-coloring graphs on surfaces III. One list of size one and one list of size two
17. Cyclically five-connected cubic graphs
18. Non-planar extensions of subdivisions of planar graphs
19. Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle
20. Three-edge-colouring doublecross cubic graphs
21. Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk
22. Odd K3,3 subdivisions in bipartite graphs
23. Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs
24. Sub-exponentially many 3-colorings of triangle-free planar graphs
25. Five-coloring graphs on the Klein bottle
26. Nested cycles in large triangulations and crossing-critical graphs
27. Large non-planar graphs and an application to crossing-critical graphs
28. [formula omitted]-free graphs with no odd holes
29. Minimally non-Pfaffian graphs
30. The extremal function for 3-linked graphs
31. Generating bricks
32. Minimal bricks
33. Independent sets in triangle-free cubic planar graphs
34. The extremal function for [formula omitted] minors
35. Hamilton paths in toroidal graphs
36. Three-coloring Klein bottle graphs of girth five
37. K4-free graphs with no odd holes
38. Proper minor-closed families are small
39. The extremal function for K9 minors
40. Generating Internally Four-Connected Graphs
41. Directed Tree-Width
42. Clique Minors in Graphs and Their Complements
43. Excluding a Countable Clique
44. Tutte's Edge-Colouring Conjecture
45. The Four-Colour Theorem
46. Five-Connected Toroidal Graphs Are Hamiltonian
47. Quickly excluding a forest
48. The menger-like property of the tree-width of infinite graphs
49. A menger-like property of tree-width: The finite case
50. Graphs without K4 and well-quasi-ordering
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.