The following pages link to Robin Thomas (Q186136):
Displaying 50 items.
- Odd \(K_{3,3}\) subdivisions in bipartite graphs (Q256986) (← links)
- Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. (Q273167) (← links)
- Three-edge-colouring doublecross cubic graphs (Q273169) (← links)
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Non-planar extensions of subdivisions of planar graphs (Q326819) (← links)
- Color-critical graphs have logarithmic circumference (Q550393) (← links)
- Large non-planar graphs and an application to crossing-critical graphs (Q631645) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- \(K_{6}\) minors in large 6-connected graphs (Q684126) (← links)
- A new proof of the flat wall theorem (Q684127) (← links)
- Five-coloring graphs on the Klein bottle (Q713974) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Nested cycles in large triangulations and crossing-critical graphs (Q765192) (← links)
- Typical subgraphs of 3- and 4-connected graphs (Q804594) (← links)
- The strong perfect graph theorem (Q855256) (← links)
- The circular chromatic index of flower snarks (Q870047) (← links)
- On well-quasi-ordering finite structures with labels (Q912875) (← links)
- The extremal function for 3-linked graphs (Q947723) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- Coloring even-faced graphs in the torus and the Klein bottle (Q949800) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- Graphs without \(K_ 4\) and well-quasi-ordering (Q1058531) (← links)
- A Menger-like property of tree-width: The finite case (Q1097894) (← links)
- The Menger-like property of the three-width of infinite graphs (Q1121910) (← links)
- Quickly excluding a forest (Q1179478) (← links)
- Analyzing Nash-Williams' partition theorem by means of ordinal types (Q1191918) (← links)
- Excluding infinite minors (Q1191928) (← links)
- An end-faithful spanning tree counterexample (Q1191929) (← links)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
- Monochromatic vs multicolored paths (Q1205343) (← links)
- Excluding a countable clique (Q1305523) (← links)
- Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018) (← links)
- Graph searching and a min-max theorem for tree-width (Q1325271) (← links)
- Call routing and the ratcatcher (Q1330799) (← links)
- 4-connected projective planar graphs are Hamiltonian (Q1333330) (← links)
- Quickly excluding a planar graph (Q1338321) (← links)
- Five-connected toroidal graphs are Hamiltonian (Q1354120) (← links)
- The four-colour theorem (Q1369648) (← links)
- Tutte's edge-colouring conjecture (Q1369658) (← links)
- Packing directed circuits (Q1375699) (← links)
- Progress on perfect graphs (Q1403295) (← links)
- Clique minors in graphs and their complements (Q1569065) (← links)
- The extremal functions for triangle-free graphs with excluded minors (Q1621057) (← links)
- Excluding subdivisions of bounded degree graphs (Q1633742) (← links)
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two (Q1682205) (← links)
- Non-embeddable extensions of embedded minors (Q1748267) (← links)
- An improved linear edge bound for graph linkages (Q1767622) (← links)
- List edge-colorings of series-parallel graphs (Q1808155) (← links)
- Clique-sums, tree-decompositions and compactness (Q1813735) (← links)
