Most cited papers in Graph Labeling and Dimension Problems
What are the most cited papers in Graph Labeling and Dimension Problems?
The most cited paper in Graph Labeling and Dimension Problems is "Parameterized Complexity" (Michael R. Fellows, 2002), with 2,911 citations. Next come "The Centrality Index of a Graph" (2,510) and "Algorithm 457: finding all cliques of an undirected graph" (2,492).
Showing 50 of 98 papers. Every paper with more than 301 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Parameterized Complexity Michael R. Fellows · Electronic Notes in Theoretical Computer Science | 2002 | 2,911 |
| 2 | The Centrality Index of a Graph Gert Sabidussi · Psychometrika | Dec 1966 | 2,510 |
| 3 | Algorithm 457: finding all cliques of an undirected graph Coen Bron, Joep Kerbosch · Communications of the ACM | Sep 1973 | 2,492 |
| 4 | Paths, Trees, and Flowers Jack Edmonds · Canadian Journal of Mathematics | 1965 | 2,399 |
| 5 | A Dynamic Survey of Graph Labeling Joseph A. Gallian · The Electronic Journal of Combinatorics | 2 Dec 2022 | 2,185 |
| 6 | Spectral Hashing Yair Weiss, Antonio B. Torralba, Rob Fergus · neural information processing systems | 8 Dec 2008 | 2,081 |
| 7 | The ellipsoid method and its consequences in combinatorial optimization Martin Grötschel, László Lovász, Alexander Schrijver · COMBINATORICA | Jun 1981 | 2,059 |
| 8 | Expander graphs and their applications Shlomo Hoory, Nathan Linial, Avi Wigderson · Bulletin of the American Mathematical Society | 7 Aug 2006 | 1,798 |
| 9 | On the Shannon capacity of a graph László Lovász · IEEE Transactions on Information Theory | 1979 | 1,675 |
| 10 | New methods to color the vertices of a graph Daniel Brélaz · Communications of the ACM | Apr 1979 | 1,586 |
| 11 | The strong perfect graph theorem Maria Chudnovsky, Neil R. Robertson, Paul D. Seymour et al. · Annals of Mathematics | Jul 2006 | 1,300 |
| 12 | Coloring of commutative rings István Beck · Journal of Algebra | Jul 1988 | 1,234 |
| 13 | A partial k-arboretum of graphs with bounded treewidth Hans L. Bodlaender · Theoretical Computer Science | Dec 1998 | 1,132 |
| 14 | Combinatorial Matrix Theory Richard A. Brualdi · Discrete mathematics and its applications | 2 Nov 2006 | 1,025 |
| 15 | Color-coding Noga Alon, Raphael Yuster, Uri Zwick · Journal of the ACM | Jul 1995 | 1,012 |
| 16 | Resolvability in graphs and the metric dimension of a graph Gary Chartrand, Linda Eroh, Mark A. Johnson et al. · Discrete Applied Mathematics | Oct 2000 | 992 |
| 17 | The Maximum Clique Problem Immanuel M. Bomze, Marco Budinich, Pãnos M. Pardalos et al. | 1999 | 987 |
| 18 | Combinatorial Algorithms Leena Salmela, Simon J. Puglisi, Mäkinen, Veli · Lecture notes in computer science | 2016 | 927 |
| 19 | On cliques in graphs John W. Moon, Leo Moser · Israel Journal of Mathematics | Mar 1965 | 864 |
| 20 | Complement reducible graphs Derek Gordon Corneil, H. Lerchs, L.Stewart Burlingham · Discrete Applied Mathematics | Jul 1981 | 845 |
| 21 | Graph Minors. XX. Wagner's conjecture Neil R. Robertson, Paul D. Seymour · Journal of Combinatorial Theory Series B | Nov 2004 | 824 |
| 22 | Landmarks in graphs Samir Khuller, Balaji Raghavachari, Azriel Rosenfeld · Discrete Applied Mathematics | Oct 1996 | 819 |
| 23 | Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width B. Courcelle, Johann A. Makowsky, Udi Rotics · Theory of Computing Systems | 4 Mar 2000 | 799 |
| 24 | Packing Lines, Planes, etc.: Packings in Grassmannian Spaces John H. Conway, Ronald H. Hardin, Neil J.A. Sloane · Experimental Mathematics | 1996 | 774 |
| 25 | Graph minors. V. Excluding a planar graph Neil R. Robertson, Paul D. Seymour · Journal of Combinatorial Theory Series B | Aug 1986 | 761 |
| 26 | Optimal packing and covering in the plane are NP-complete Robert J. Fowler, Michael Stewart Paterson, Steven L. Tanimoto · Information Processing Letters | Jun 1981 | 729 |
| 27 | The intersection graphs of subtrees in trees are exactly the chordal graphs Fǎnicǎ Gavril · Journal of Combinatorial Theory Series B | Feb 1974 | 699 |
| 28 | Which graphs are determined by their spectrum? Edwin van Dam, Willem H. Haemers · Linear Algebra and its Applications | 27 May 2003 | 682 |
| 29 | On the complexity of H-coloring Pavol Hell, Jaroslav Nešetřil · Journal of Combinatorial Theory Series B | Feb 1990 | 674 |
| 30 | Graph minors. X. Obstructions to tree-decomposition Neil R. Robertson, Paul D. Seymour · Journal of Combinatorial Theory Series B | Jul 1991 | 673 |
| 31 | Optimum branchings Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics | Oct 1967 | 671 |
| 32 | Depth-first search and linear graph algorithms Robert Endre Tarjan | Oct 1971 | 662 |
| 33 | Log‐Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry a Richard P. Stanley · Annals of the New York Academy of Sciences | Dec 1989 | 650 |
| 34 | How to draw a planar graph on a grid Hubert de Fraysseix, János Pach, Richard M. Pollack · COMBINATORICA | Mar 1990 | 649 |
| 35 | Graph Theory and Probability P. Erdös · Birkhäuser Boston eBooks | 2009 | 647 |
| 36 | A Linear Recognition Algorithm for Cographs Derek Gordon Corneil, Yehoshua Perl, Laura K. Stewart · SIAM Journal on Computing | Nov 1985 | 646 |
| 37 | Combinatorial Nullstellensatz Noga Alon · Combinatorics Probability Computing | 1999 | 641 |
| 38 | Approximate distance oracles Mikkel Thorup, Uri Zwick · Journal of the ACM | 2005 | 627 |
| 39 | Edmonds polytopes and a hierarchy of combinatorial problems Vašek Chvátal · Discrete Mathematics | Apr 1973 | 625 |
| 40 | Finding and counting given length cycles Noga Alon, Raphael Yuster, Uri Zwick · Algorithmica | Mar 1997 | 625 |
| 41 | On certain polytopes associated with graphs Vašek Chvátal · Journal of Combinatorial Theory Series B | Apr 1975 | 619 |
| 42 | On sparse spanners of weighted graphs Ingo Althöfer, Gautam Das, David Dobkin et al. · Discrete & Computational Geometry | 1993 | 603 |
| 43 | Graphs of Extremal Weights. Béla Bollobás, P. Erdös · Ars Combinatoria | Dec 1998 | 565 |
| 44 | Colorings and orientations of graphs Noga Alon, Michael Tarsi · COMBINATORICA | Jun 1992 | 517 |
| 45 | Combinatorial Properties of Matrices of Zeros and Ones H. J. Ryser · Canadian Journal of Mathematics | 1957 | 514 |
| 46 | Triangulated graphs and the elimination process Donald J. Rose · Journal of Mathematical Analysis and Applications | Dec 1970 | 511 |
| 47 | Laplacian energy of a graph İvan Gutman, Bo Zhou · Linear Algebra and its Applications | 28 Oct 2005 | 499 |
| 48 | On the Metric Dimension of Cartesian Products of Graphs José Cáceres, Carmen Hernando, Mercè Ferrater Mora et al. · SIAM Journal on Discrete Mathematics | 2007 | 475 |
| 49 | A constructive proof of the general lovász local lemma Robin A. Moser, Gábor Tardos · Journal of the ACM | 2010 | 473 |
| 50 | Distance-hereditary graphs Hans‐Jürgen Bandelt, Henry Martyn Mulder · Journal of Combinatorial Theory Series B | Oct 1986 | 468 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.