| 1903 |
Veblen.O |
| 1907 |
Birkhoff.GD |
| 1911 |
Lefschetz.S |
| 1920 |
Brahana.HR |
| 1921 |
Errera.A | Du coloriage des cartes et de quelques questions d'analysis situs |
| Franklin.P | The four color problem |
| 1931 | Coxeter.HSM |
| 1932 |
Whitney.H | The coloring of graphs |
| 1934 |
Erdos.P |
| 1935 | Wagner.K | Über zwei Sätze der Topologie: Jordanscher Kurvensatz und Vierfarbenproblem |
| 1940 | Shannon.CE |
| 1945 | Renyi.A |
| 1948 | Harary.F |
| Stanton.RG |
| Tutte.WT | An algebraic theory of graphs |
| 1950 | Shrikhande.SS |
| 1952 | Sabidussi.G |
| 1953 | Saaty.TL |
| Schuster.S |
| 1956 | Berge.C |
| Hajnal.A |
| 1957 | Grunbaum.B |
| 1958 | Kleitman.DJ |
| Wilf.HS |
| 1959 | Appel.K |
| Balaban.AT |
| Nash-Williams.CStJA | Decomposition of graphs into infinite chains |
| Read.RC | Some enumeration problems in graph theory |
| 1960 | Harzheim.E |
| 1961 | Chao.CY |
| Fraenkel.AS |
| Hare.WR |
| Lick.DR |
| 1962 | Graham.RL |
| Halin.R | Über einen graphentheoretischen Basisbegriff und seine Anwendung auf Färbungsprobleme |
| Jung.HA | Maximal-Gamma-prime Graphen |
| Laskar.RC |
| Melter.RA |
| Pullman.NJ |
| Vanden_Eynden.C |
| 1963 | Boesch.FT |
| Hemminger.RL |
| Knuth.DE |
| 1964 | Brualdi.RA |
| Chartrand.G | Graphs and their associated line-graphs |
| Clark.WE |
| Kronk.HV |
| Lomonaco.SJJr |
| Mullin.RC |
| Sendov.B |
| Shult.EE |
| Watkins.ME | A characterization of the planar geodetic graph and some geodetic properties of non-planar graphs |
| 1965 | Beineke.LW | On the decomposition of complete graphs into planar and other subgraphs |
| Bevis.JH |
| Deo.N |
| Duke.RA | Minimal imbeddings and open mappings of graphs in manifolds |
| Harborth.H |
| Palmer.EM | Graphical enumeration and the power group |
| Sampathkumar.E |
| 1966 | Alspach.B | A class of tournaments |
| Bender.EA |
| Dierker.P |
| Goetschel.RHJr |
| Hedetniemi.ST | Homomorphisms of graphs and automata |
| Matula.DW |
| Parsons.TD |
| Parthasarathy.KR | Certain enumeration problems in graph theory |
| Pippert.RE |
| Plummer.MD | On the theory of graphical coverings |
| Robinson.RW |
| Sauer.NW |
| Street.AP |
| Zhang.ZF | Some problems of graph theory |
| 1967 | Barnette.DW | Polyhedral graphs |
| Chen.CC |
| Cockayne.EJ |
| Glover.HH |
| Huneke.JP |
| Mader.W | Über trennende Eckenmengen in homomorphiekritischen Graphen |
| Mowshowitz.A | Entropy and the complexity of graphs |
| Quintas.LV | Extrema concerning asymmetric graphs |
| Shreve.WE |
| Simoes-Pereira.JMS |
| 1968 | Bertram.E |
| Bogart.KP |
| Corneil.DG |
| Gross.JL |
| Katona.GOH |
| Kelmans.AK |
| Thulasiraman.K | Analysis and synthesis of K and Y Matrices of resistance n-port networks |
| Malkevitch.J | Properties of planar graphs with uniform vertex and face structure |
| Reid.KB | Structure in finite graphs |
| Roberts.FS |
| Rousseau.CC |
| Trotter.WTJr |
| Wallis.WD |
| Wilson.RJ |
| Zaks.J |
| 1969 | Beasley.LB |
| Burr.SA |
| Chinn.PZ | Graph isomorphisms |
| Lindner.CC |
| McMorris.FR |
| Merris.R |
| Robertson.GN | Graphs minimal under girth, valency and connectivity constraints |
| Shelah.S |
| Starling.AG |
| Tucker.AC | Two characterizations of proper circular-arc graphs |
| White.AT | The genus of Cartesian products of graphs |
| Woodall.DR |
| Yebra.JLA |
| de_Werra.D |
| 1970 | Bhat-Nayak.VN |
| Blass.A |
| Brigham.RC |
| Chvatal.V |
| Garey.MR |
| Hanson.D |
| Kainen.PC |
| Liskovets.VA | Some enumerative problems of graph theory (Russian) |
| Lovasz.L | Factors of graphs |
| Manvel.B | On reconstruction of graphs |
| Mitchem.J | On extremal partitions of graphs |
| Rao.AR |
| Ringeisen.RD | The maximum genus of a graph |
| Schelp.RH |
| Selkow.SM |
| Spencer.J |
| Sumner.DP | Indecomposable graphs |
| Wong.CK |
| 1971 | Albertson.MO | Irreducibility and coloring problems |
| Gallian.JA |
| Hobbs.AM | Hamiltonian cycles in powers of graphs |
| Jones.GA |
| Lundgren.JR |
| Rao.SB |
| Stockmeyer.PK | Enumeration of graphs with prescribed automorphism group |
| Tomescu.I |
| Tucker.TW | On non-compact 3-manifolds which are end-irreducible |
| Walsh.TR | Combinatorial enumeration of non-planar maps |
| Whitehead.EGJr | Ramsey numbers of the form N(3,...,3;2) |
| 1972 | Barkauskas.AE |
| Bollobas.B |
| Fisk.S | Triangulations of two manifolds with local properties |
| Gernert.D |
| Lam.PCB |
| 1973 | Berman.DM | On the number of 5-cycles in a tournament |
| Cunningham.WH |
| Eggleton.RB |
| Farrell.EJ | On a general class of graph polynomials |
| Greenwell.DL | Graphs with forbidden subgraphs |
| Hell.P | Retractions de graphes |
| Hutchinson.JP | Eulerian graphs and polynomial identities for sets of matrices |
| Johnson.DS |
| Johnson.PDJr |
| Laue.R |
| Lawson.LM |
| Little.CHC | On Kasteleyn's method of enumerating the 1-factors of a graph |
| Schwenk.AJ | The spectrum of a graph |
| Slater.PJ | Classifying n-connected graphs |
| Soifer.A |
| Tarjan.RE |
| Vijayan.K |
| Volkmann.L |
| Weiss.RM | Kantenprimitive Graphen dritten Grades |
| Williams.K |
| 1974 | Chung.FRK | Ramsey numbers and combinatorial designs |
| Dewdney.AK | Extensions and generalizations of graph theorems to complexes and hypergraphs |
| Gabow.HN |
| Grossman.JW |
| Hall.JI |
| Ihrig.EC |
| Jamison.RE |
| Lesniak.LM | On the theory of Hamiltonian graphs |
| Matthews.KR |
| McKee.TA |
| Mehlhorn.K |
| Melnikov.LS | Threshold functions of some classes of graphs |
| Nishizeki.T |
| Praeger.CE |
| Proskurowski.A | Automatic generation of graphs |
| Singhi.NM |
| Zaslavsky.T |
| 1975 | Acharya.BD |
| Babai.L |
| Bermond.JC |
| Canfield.ER |
| Choudum.SA | Some analysis, synthesis and enumeration problems in graph theory |
| Dejter.IJ |
| Finbow.A |
| Golumbic.MC |
| Klerlein.JB |
| Kubale.M | Algorithms for control of close networks |
| Mahmoodian.ES |
| McDiarmid.C | Independence structures and linking in graphs |
| Mengersen.I | Kreuzungsfreie Kanten in vollstandigen n-geteilten Graphen |
| Odlyzko.AM |
| Seymour.PD | Matroids, hypergraphs and the max-flow min-cut theorem |
| Stahl.S | The self-dual imbeddings of graphs |
| Winkler.PM |
| Wojda.AP | On hamiltonian problems |
| Yellen.J |
| 1976 | Brandstadt.A |
| Catlin.PA | Embedding subgraphs and coloring graphs under extremal degree conditions |
| Jacobs.DP |
| Kulli.VR |
| Lih.KW |
| Lipman.MJ |
| Neumaier.A | Tupelsysteme - eine gemeinsame Theorie für Blockpläne und othogonale Arrays |
| Papadimitriou.CH |
| Peled.UN |
| Thomassen.C | Paths and cycles in graphs |
| Wierman.JC |
| Woodrow.RE |
| 1977 | Asano.T |
| de_Fraysseix.H | Quelques problèmes de parité sur les graphes et les courbes planes |
| Gessel.IM |
| Griggs.JR |
| Grotschel.M |
| Hassin.R |
| Hedetniemi.SM | Algorithms on trees and maximal outerplanar graphs: design, complexity analysis
and data structures study |
| Janson.S |
| Naik.RN | Some new results in graph theory |
| Perkel.M | On finite groups acting on polygonal graphs |
| Ruskey.F |
| Sands.B |
| Savage.CD | Parallel solutions to graph theoretic problems |
| Straight.HJ | Partitions of the vertex set and edge set of a graph |
| Thomas.DA |
| 1978 | Bauer.D | Degree sequences and line graphs |
| Brand.N |
| Cornuejols.GP |
| Duffus.DA |
| Dymacek.WM | Steinhaus graphs and tournaments |
| Jackson.Bi | Cycles in graphs |
| Nowakowski.RJ |
| Prodinger.H |
| Staton.W |
| Ustimenko.VA |
| West.DB | Characterizing extremal configurations |
| 1979 | Berman.KA |
| Davis.GJ |
| Frank.A |
| Gould.RJ | Traceability in graphs |
| Harju.T |
| Heinrich.K |
| Jendrol.S | On the face and vertex vectors |
| Kahn.J |
| Kierstead.HA |
| Kocay.WL | K-reconstruction of graphs |
| Miller.Ze |
| Mitchell.CJ |
| Sagan.BE |
| Simeone.B | Quadratic 0-1 programming, Boolean functions and graphs |
| Steinberg.R | Flows, colorings and embeddings of graphs |
| Trenkler.M | Cell-decompositions of orientable 2-manifolds with regular graphs |
| 1980 | Ainouche.A | Connectivity, independent sets and maximal circuits in undirected graphs |
| Anstee.RP | Moore Type Graphs; etc. |
| Archdeacon.D | A Kuratowski theorem for the projective plane |
| Asratian.AS |
| Clark.LH |
| Colbourn.CJ | The complexity of graph isomorphism and related problems |
| Conder.M |
| Dinitz.JH |
| Exoo.G | Extremal adjacency graphs |
| Fu.HL |
| Hartman.A |
| Host.LH |
| Jacobson.MS | On various extensions of Ramsey theory |
| Poljak.S |
| Saks.M |
| Shearer.JB |
| Urrutia.J | Intersection graphs of some families of plane curves |
| Watkins.JJ |
| Woess.W |
| 1981 | Cozzens.MB | Higher and multi-dimensional analogues of interval graphs |
| Furedi.Zo |
| Hahn.G | Directed hypergraphs: the groups of their composition |
| Hsu.LH | Monotone multiplicative graph functions and dependence of tree copy functions |
| Lauri.J | The reconstruction of planar graphs |
| Marcu.D | Algebraic and combinatorial methods for the study of network connectivity |
| Pach.J | On universal graphs |
| Pisanski.T | Orientabilne in neorientabilne vlozitve grafov |
| Stinson.DR |
| Vince.A | Combinatorial maps |
| Walikar.HB |
| 1982 | Chang.GJ |
| Comellas.F |
| Farber.M |
| Fiol.MA | Aplicaciones de la Teoria de Grafos al Diseño de Redes de Interconexión de Multiprocesadores |
| Fraughnaugh.KL | Independence in graphs with maximum degree four |
| Guichard.DR |
| Kemnitz.A |
| Kwak.JH |
| Lewinter.M |
| Locke.SC | Extremal Properties of Paths, Cycles and k-Colourable Subgraphs of Graphs |
| Plantholt.MJ | Coloring the lines of a graph |
| Rodger.CA |
| Spinrad.JR |
| Steiner.G |
| Terwilliger.P | Distance-regular graphs and generalizations |
| de_Caen.D | On Turan's hypergraph problem |
| 1983 | Bridgland.MF | Geodetic graphs and convexity |
| Conforti.M |
| Esfahanian.AH | On the connectivities of networks with application to multiple processors systems |
| Gill.MK |
| Gordon.G |
| Ramachandran.V |
| Richter.RB | The topology of embedded graphs |
| Rucinski.A |
| Szekely.LA | Geometric graphs |
| Vazirani.VV |
| Voloshin.VI |
| Wigderson.A |
| Zieschang.PH |
| 1984 | Bagga.JS | Some structural properties of bipartite tournaments |
| Beezer.RA | Polynomials of the adjacency matrix of a graph |
| Fabrega.J | Grafos y Redes de Interconexión: Diseño, Fiabilidad y Encaminamiento |
| Gimbel.JG | The chromatic and cochromatic number of a graph |
| Hartsfield.N | The toroidal splitting number of the complete Kn |
| Hartvigsen.D |
| Kano.M | [a,b]-factorizations of graphs |
| Komjath.P |
| Kreher.DL |
| Neeralagi.PS |
| Okamura.H | Muticommodity flows in graphs |
| Pfaff.J | Algorithmic complexities of domination-related graph parameters |
| Pritikin.D | Extremal problems in graph homomorphisms and vertex identifications |
| Scheinerman.ER | Intersection classes and multiple intersection parameters of graphs |
| Shamir.R |
| Shao.JY | On the properties of nonnegative primitive matrices, irreducible matrices and their associated directed graphs |
| Woldar.AJ |
| 1985 | Boros.E |
| Du.DZ |
| Fisher.DC |
| Holzman.R |
| Karloff.HJ |
| Khelladi.A | Propriétés algébriques de structures combinatoires |
| Miller.VA |
| Piazza.BL | Connectivity and Hamiltonian properties of permutation graphs |
| Roditty.Y | On decomposition of graphs and related problems |
| Seress.A |
| Shawe-Taylor.J |
| Simpson.RJ |
| Stewart.LK | Permutation graphs: structure and algorithms |
| Stueckle.SK | Algebraic and isomorphism properties of cycle permutation graphs |
| Vijayakumar.A |
| Witte.D |
| Yeh.YN |
| 1986 | Batagelj.V | Inductive classes of graphs |
| Bodlaender.HL |
| Chisala.BP |
| Collins.KL | Distance matrices of trees |
| Edwards.CS | Some extremal problems in graph theory |
| Ellingham.MN | Isomorphic factorisations of regular graphs |
| Goss.CF |
| Hartman.IBA | Path partitions and packings in directed graphs |
| Hong.S |
| Mohar.B | Grafi v kombinatorieni topologiji |
| Oellermann.OR | Generalized connectivity in graphs |
| Olariu.S |
| Rees.RS | On certain (1,2)-factorizations of the complete graph |
| Ryan.J |
| Ryjacek.Zd | Graphs with isomorphic and connected neighborhoods |
| Saito.A | Connectivity in graphs |
| Sali.A |
| Stuart.J |
| Tipnis.SK |
| Wakabayashi.Y |
| Zhang.CQ |
| Zhou.B | Topics in graph theory (depth-first search, backtracking, randomly near-traceable, complement of trees) |
| 1987 | Brown.JI | A theory of generalized graph colourings |
| Caro.Y | Decompositions and partitions of graphs |
| Chen.J |
| Chepoi.VD |
| Dean.N | Contractible edges and conjectures about path and cycle numbers |
| Erickson.M |
| Friedman.J |
| Harminc.M |
| Hayward.RB | Two classes of perfect graphs |
| Kratochvil.J | Perfect codes in graphs and their powers (Czech) |
| Lazebnik.F | Some extremal problems for graphs with fixed numbers of vertices |
| Luczak.T | Asymptotic properties of the core of a random graph |
| Petrovic.V |
| Royle.GF | Constructive enumeration of graphs |
| Vitray.RP | Representativity and flexibility of drawings of graphs on the projective plane |
| 1988 | Bang-Jensen.J | Path problems and generalized colouring problems for tournaments and other classes of digraphs: characterizations, algorithms, and complexity |
| Borie.RB | Recursively constructed graph families: membership and linear algorithms |
| Diwan.AA |
| Domke.GS | Variations of colorings, coverings and packings of graphs |
| Hajnal.P | The complexity of graph problems |
| Haynes.TW |
| Lai.HJ |
| Lemos.M |
| Lindquester.TE | Effects of distance and adjacency conditions on Hamiltonian properties in graphs |
| Margaritis.KG |
| Myrvold.WJ | The ally and adversary reconstruction problems |
| Shahrokhi.F | Design and analysis of efficient routing algorithms to determine the maximum concurrent flow in networks |
| Srivastav.A |
| Vrto.I |
| 1989 | Azar.Y |
| Eppstein.D |
| Goddyn.LA | Cycle covers of graphs |
| Guan.DJ |
| Hare.EO | Algorithms for grids and grid-like graphs |
| Hattingh.JH |
| Jayaram.SR | Some studies in graph theory, Domination/neighbourhood related problems |
| Kirkland.SJ |
| Knisley.DJ |
| Kubicka.E | The chromatic sum and efficient tree algorithms |
| Kubicki.G | Greatest common subgraphs |
| Oporowski.B | Seymour's self-minor conjecture for infinite graphs |
| Peng.YH | On the factor-index, factor-thickness and edge-toughness of a graph |
| Riskin.A | Minimal maps on the pinched torus |
| Sanchis.LA |
| Serra.O |
| Zemor.G |
| Zito.J | {a,c}-critical graphs |
| Zwick.U |
| 1990 | Abay-Asmerom.G | Graph products and covering graph imbeddings |
| Babel.L | Ein Branch and Bound-Verfahren zur Lösung des Maximum-Clique-Problems |
| Cerdeira.JO |
| Dragan.FF | Centers in graphs and the Helly property |
| Gu.W |
| Hurlbert.GH |
| Isaak.G |
| Ivanco.J | Characteristical numbers of partitions of independence systems and graphs |
| Jha.PK | Hypercubes, median graphs and products of graphs: Some algorithmic and combinatorial results |
| Klavzar.S | Grafovski retrakti (Slovene) (Graph retracts) |
| Kohayakawa.Y |
| Lawrencenko.S | A study of triangular embeddings of a graph in a fixed surface |
| Lee.J | Enumeration of graph coverings and bundles |
| MacGillivray.G | The complexity of generalised colourings |
| Sanders.RS | Graphs on which dihedral, quaternion, and Abelian groups act vertex and/or edge transitively and applications to tensor products |
| Seyffarth.K | Cycle and path covers of graphs |
| Shader.BL | Biclique partitions and tournaments |
| Smyth.WF |
| Steffen.E |
| Steger.A |
| Thatte.BD | Reconstruction problems in graph theory |
| Wojciechowski.J | Long induced cycles and colourings of graphs |
| Yu.X | Contractible edge covers in 3-connected graphs |
| 1991 | Bau.S | Cycles in regular graphs |
| Boland.JW | Inclusive connectivity, a local graph connectivity parameter |
| Chen.G |
| Chen.ZH | Reductions of graphs and spanning Eulerian subgraphs |
| Di_Battista.G |
| Ding.G |
| El-Zanati.SI |
| de_Figueiredo.CMH |
| George.JC | 1-factorizations of tensor products of graphs |
| Halldorsson.MM |
| Hare.DR | The block-intersection graph of pairwise balanced designs |
| Kezdy.AE | Studies of connectivity |
| Kobayashi.M | Exact coverings of 2-paths by Hamilton cycles |
| Li.XL | Transformation graphs |
| Liu.DDF | Graph homomorphisms and the channel assignment problem |
| Nikolopoulos.SD |
| Rampon.JX |
| Randby.SP | Embedding K5 in 4-connected graphs |
| Snevily.HS |
| Tetali.P |
| Trenk.AN | Generalized perfect graphs |
| Yu.QL | Matching and matching extensions in graphs |
| Zhu.XD |
| 1992 | Baca.M |
| Bonnington.CP |
| Cai.L |
| Carrington.JR |
| Changat.M |
| Eaton.N |
| Felsner.S |
| Gethner.E |
| Goddard.W |
| Greenwood.GW |
| Gustedt.J |
| Huang.J |
| Jipsen.P |
| Kaneko.A |
| Klostermeyer.WF |
| Liu.JQ |
| Markus.LR |
| Piotrowski.W |
| Soares.J |
| Wang.D |
| Wang.H |
| Zhao.C |
| Zhao.Y |
| 1993 | Bodroza.O |
| Brewster.RC |
| Burris.AC |
| Cowen.LJ |
| Dankelmann.P |
| Gutin.GM |
| Kim.JH |
| Lin.X |
| Quinn.JJ |
| Rivera-Campo.E |
| Sanders.DP |
| Wang.P |
| Wanner.T |
| Winters.SJ |
| Zha.X |
| Zverovich.VE |
| 1994 | Aguilo.F |
| Ananchuen.N |
| Ananchuen.W |
| Brandt.S |
| Brunat.JM |
| Faria.I |
| Froncek.D |
| Ginn.M |
| Kayll.PM |
| Khodkar.A |
| Le.VB |
| de_Mendez.PO |
| Molloy.M |
| Padro.C |
| Rusu.I |
| Sarkozy.GN |
| Vuskovic.K |
| Yuster.R |
| 1995 | Balbuena.MC |
| Carmona.A |
| Cheng.E |
| Ellis-Monaghan.JA |
| Gunderson.DS |
| Guo.Y |
| Haile.D |
| Harris.JM |
| Horrocks.DGC |
| Hougardy.S |
| Jajcay.R |
| Juvan.M |
| Lee.SK |
| Liotta.G |
| Lozin.VV |
| Merz.SK |
| Soltes.L |
| Tanenbaum.PJ |
| Wingard.GC |
| Zhang.P |
| 1996 | Baskoro.ET |
| Byer.OD |
| Chappell.GG |
| Chen.JJ |
| Ciucu.M |
| van_Dam.ER |
| Gavlas.H |
| Gravier.S |
| Jensen.TR |
| Jurkiewicz.S |
| Kotlov.A |
| Lee.HY |
| Maharry.J |
| Munoz.X |
| Pasechnik.DV |
| Pike.DA |
| Schultz.M |
| Thiele.T |
| Thilikos.DM |
| 1997 | Al-Hawary.TA |
| Brankovic.L |
| Fernandes.CG |
| Fitzpatrick.SL |
| Fomin.FV |
| Giudici.RE |
| Katona.GY |
| Krivelevich.M |
| Li.CH |
| Lu.HI |
| Noble.SD |
| Stacho.L |
| Wanless.IM |
| 1998 | Berry.A |
| Bonato.A |
| Bornstein.CF |
| Calinescu.G |
| Dobrynin.AA |
| Eslahchi.C |
| Faudree.JR |
| Fowler.TG |
| Iranmanesh.MA |
| Kriesell.M |
| Labbate.D |
| Mehrabadi.ML |
| Mubayi.D |
| Protti.F |
| Randerath.B |
| Rautenbach.D |
| Sarmiento.I |
| Semanisin.G |
| Shen.J |
| Vu.VH |
| Wu.JL |
| Yeo.A |
| 1999 | Achlioptas.D |
| Axenovich.M |
| Barbosa.R |
| Daven.M |
| Emden-Weinert.T |
| Hajiabolhassan.H |
| Hlineny.P |
| Kheddouci.H |
| Kundgen.A |
| Sudakov.B |
| Tewes.M |
| Tusserkani.R |
| 2000 | Ait_Haddadene.H |
| Balaji.K |
| Gimbert.J |
| Maureso.M |
| Merino.C |
| Narayan.DA |
| Pelayo.I |
| Pikhurko.O |
| Weinreich.D |
| Zhou.G |
| Zhou.SM |
| 2001 | Gruenewald.S |
| Madaras.T |
| Zaker.M |