Neil Robertson
#169,401
Most Influential Person Now
Neil Robertson's AcademicInfluence.com Rankings
Neil Robertsoncomputer-science Degrees
Computer Science
#10338
World Rank
#10850
Historical Rank
Database
#7313
World Rank
#7572
Historical Rank
Download Badge
Computer Science
Why Is Neil Robertson Influential?
(Suggest an Edit or Addition)Neil Robertson's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Graph Minors. II. Algorithmic Aspects of Tree-Width (1986) (1633)
- Graph Minors .XIII. The Disjoint Paths Problem (1995) (1255)
- Graph Minors. XX. Wagner's conjecture (2004) (885)
- Graph minors. III. Planar tree-width (1984) (755)
- Graph Minors: XV. Giant Steps (1996) (749)
- Graph minors. V. Excluding a planar graph (1986) (742)
- Graph minors. X. Obstructions to tree-decomposition (1991) (713)
- The Four-Colour Theorem (1997) (606)
- The Strong Perfect Graph Theorem (2002) (598)
- Graph minors. I. Excluding a forest (1983) (584)
- Quickly Excluding a Planar Graph (1994) (444)
- Graph Minors. XVI. Excluding a non-planar graph (2003) (334)
- Hadwiger's conjecture forK6-free graphs (1993) (288)
- Directed Tree-Width (2001) (277)
- PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS (1999) (240)
- Graph minors. IV. Tree-width and well-quasi-ordering (1990) (203)
- Sachs' Linkless Embedding Conjecture (1995) (199)
- Graph minors. VII. Disjoint paths on a surface (1988) (168)
- Packing directed circuits (1996) (167)
- Surveys in combinatorics 1985: Graph minors – a survey (1985) (164)
- A new proof of the four-colour theorem (1996) (159)
- Graph minors. VIII. A kuratowski theorem for general surfaces (1990) (151)
- Graph minors XXIII. Nash-Williams' immersion conjecture (2010) (141)
- Quickly excluding a forest (1991) (115)
- Efficiently four-coloring planar graphs (1996) (115)
- Graph minors. IX. Disjoint crossed paths (1990) (113)
- Graph minors. VI. Disjoint paths across a disc (1986) (104)
- Graph Minors. XI. Circuits on a Surface (1994) (97)
- Linkless embeddings of graphs in 3-space (1993) (65)
- Disjoint Paths—A Survey (1985) (65)
- Graph Minors .XII. Distance on a Surface (1995) (65)
- Graph Minors: XVII. Taming a Vortex (1999) (62)
- A survey of linkless embeddings (1991) (60)
- Tutte's Edge-Colouring Conjecture (1997) (59)
- Progress on perfect graphs (2003) (57)
- Finding disjoint trees in planar graphs in linear time (1991) (55)
- Excluding a graph with one crossing (1991) (54)
- Computing the orientable genus of projective graphs (1995) (53)
- Graph minors. XXI. Graphs with unique linkages (2009) (53)
- Graph Minors. XXII. Irrelevant vertices in linkage problems (2012) (51)
- On the excluded minors for the matroids of branch-width k (2003) (50)
- Graph Minors. XIX. Well-quasi-ordering on a surface (2004) (41)
- Permanents, Pfaffian orientations, and even directed circuits (extended abstract) (1997) (41)
- The smallest graph of girth 5 and valency 4 (1964) (40)
- K4-free graphs with no odd holes (2010) (39)
- Obstructions to branch-decomposition of matroids (2006) (37)
- Covering Three Edges with a Bond in a Nonseparable Graph (1980) (28)
- Graph Minors .XIV. Extending an Embedding (1995) (26)
- Excluding infinite minors (1991) (25)
- Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering (2003) (22)
- Petersen Family Minors (1995) (22)
- Excluding subdivisions of infinite cliques (1992) (20)
- Hadwiger number and chromatic number for near regular degree sequences (2010) (19)
- The structure of graphs not topologically containing the Wagner graph (2016) (19)
- On the orientable genus of graphs embedded in the klein bottle (1991) (18)
- Some New Results on the Well-Quasi-Ordering of Graphs (1984) (18)
- Minimal cyclic-4-connected graphs (1984) (18)
- Planar graphs on the projective plane (1996) (16)
- Kuratowski Chains (1995) (16)
- Flexibility of Polyhedral Embeddings of Graphs in Surfaces (2001) (16)
- Planar Graphs on Nonplanar Surfaces (1996) (16)
- On a Conjecture Concerning the Petersen Graph (2011) (16)
- Excluding Infinite Clique Minors (1995) (15)
- Cyclically five-connected cubic graphs (2015) (13)
- Closed 2-cell embeddings of graphs with no V8-minors (2001) (12)
- On the flexibility of toroidal embeddings (2008) (10)
- Excluding A Grid Minor In Planar Digraphs (2015) (10)
- Excluded minors in cubic graphs (2014) (9)
- Automorphisms of subgraphs obtained by deleting a pendant vertex (1972) (8)
- On structural descriptions of lower ideals of trees (2005) (8)
- Disjoint Essential Cycles (1996) (7)
- Disjoint Essential Circuits in Toroidal Maps (1991) (6)
- Pentagon-Generated Trivalent Graphs with Girth 5 (1971) (6)
- On the maximum number of diagonals of a circuit in a graph (1980) (3)
- Flexibility of projective-planar embeddings (2017) (3)
- Tree ideals and algorithms (1999) (3)
- Girth Six Cubic Graphs Have Petersen Minors (2014) (3)
- Graph structure theory : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held June 22 to July 5, 1991, with support from the National Science Foundation and the Office of Naval Research (1993) (2)
- Some Structural Properties of Unitary Addition Cayley Graphs (2020) (2)
- Discharging cartwheels (2014) (1)
- Logic and Combinatorics (2011) (1)
- Reducibility in the Four-Color Theorem (2014) (1)
- Graph Structure Theory: Proceedings of a Joint Summer Research Conference on Graph Minors Held June 22 to July 5, 1991, at the University of Washington, Seattle. Contemporary Mathematics 147 (1991) (1)
- 2 5 M ar 2 01 7 CYCLICALLY FIVE – CONNECTED CUBIC GRAPHS (2021) (0)
- Path traversability in planar graphs (1974) (0)
- Flexibility of Embeddings of a Halin Graph on the Projective Plane (2017) (0)
- Paul Catlin 1948-1995 (2001) (0)
- Prospects for the Hadwiger Conjecture (0)
- C O ] 2 O ct 2 01 5 Excluding A Grid Minor In Planar Digraphs (0)
- THE 4-COLOR PROBLEM (2008) (0)
This paper list is powered by the following services:
