About
Technology
Issues
FAQ
Search
Scientometrics
Impact Factor
Discipline Ranks
h
-index
g
-index
Articles
Citations
Article Citations
Citation Distribution
Overviews
Top Institutions
Top Schools
Top Authors
Prolific Authors
Top Articles
Citing Bodies
Top Citing Authors
Top Citing Institutions
Top Citing Schools
Top Citing Journals
Top Citing Disciplines
exaly
›
Journals
›
Discrete Mathematics
›
top-articles
Discrete Mathematics
0.6
(top 50%)
impact factor
16.6K
(top 1%)
papers
166.7K
(top 5%)
citations
113
(top 5%)
h
-index
0.6
(top 50%)
extended IF
17.7K
all documents
174.4K
doc citations
171
(top 5%)
g
-index
Top Articles
#
Title
Journal
Year
Citations
1
Unit disk graphs
Discrete Mathematics
1990
1,159
2
On the ratio of optimal integral and fractional covers
Discrete Mathematics
1975
889
3
Normal hypergraphs and the perfect graph conjecture
Discrete Mathematics
1972
644
4
A characterization of the minimum cycle mean in a digraph
Discrete Mathematics
1978
532
5
Edmonds polytopes and a hierarchy of combinatorial problems
Discrete Mathematics
1973
501
6
Balanced incomplete block designs and related designs
Discrete Mathematics
1975
463
7
Tough graphs and hamiltonian circuits
Discrete Mathematics
1973
453
8
A note on Hamiltonian circuits
Discrete Mathematics
1972
405
9
A characterization of the minimum cycle mean in a digraph
Discrete Mathematics
1978
392
10
Vertex-to-vertex pursuit in a graph
Discrete Mathematics
1983
389
11
A method in graph theory
Discrete Mathematics
1976
355
12
Hamiltonian circuits in random graphs
Discrete Mathematics
1976
331
13
Modular decomposition and transitive orientation
Discrete Mathematics
1999
328
14
Roman domination in graphs
Discrete Mathematics
2004
326
15
Decomposition by clique separators
Discrete Mathematics
1985
324
16
Acyclic orientations of graphs
Discrete Mathematics
1973
315
17
A characterisation of rigid circuit graphs
Discrete Mathematics
1974
303
18
Combinatorial aspects of continued fractions
Discrete Mathematics
1980
295
19
Linear codes with complementary duals
Discrete Mathematics
1992
282
20
Characterizations of strongly chordal graphs
Discrete Mathematics
1983
280
21
On the extraconnectivity of graphs
Discrete Mathematics
1996
278
22
Some results about the cross-correlation function between two maximal linear sequences
Discrete Mathematics
1976
251
23
Circular chromatic number
Discrete Mathematics
2001
250
24
Stabilized column generation
Discrete Mathematics
1999
243
25
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
Discrete Mathematics
1980
239
26
On acyclic colorings of planar graphs
Discrete Mathematics
1979
237
27
Bounds for sorting by prefix reversal
Discrete Mathematics
1979
234
28
A generalization of carathéodory's theorem
Discrete Mathematics
1982
232
29
Otakar Borůvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history
Discrete Mathematics
2001
229
30
A survey of selected recent results on total domination in graphs
Discrete Mathematics
2009
226
31
List colourings of planar graphs
Discrete Mathematics
1993
222
32
Explicit construction of linear sized tolerant networks
Discrete Mathematics
1988
216
33
Automorphism groups and isomorphisms of Cayley digraphs
Discrete Mathematics
1998
216
34
Riordan arrays and combinatorial sums
Discrete Mathematics
1994
201
35
Problems and algorithms for covering arrays
Discrete Mathematics
2004
201
36
On the second eigenvalue of a graph
Discrete Mathematics
1991
200
37
Limit distribution for the existence of hamiltonian cycles in a random graph
Discrete Mathematics
1983
196
38
On irregular total labellings
Discrete Mathematics
2007
195
39
Families of k-independent sets
Discrete Mathematics
1973
191
40
The r-Stirling numbers
Discrete Mathematics
1984
186
41
T-colorings of graphs: recent results and open problems
Discrete Mathematics
1991
186
42
Generating all graph coverings by permutation voltage assignments
Discrete Mathematics
1977
184
43
On computing the length of longest increasing subsequences
Discrete Mathematics
1975
183
44
Developments on spectral characterizations of graphs
Discrete Mathematics
2009
183
45
Disjoint paths in graphs
Discrete Mathematics
1980
182
46
Generating trees and the Catalan and Schröder numbers
Discrete Mathematics
1995
181
47
A classification of self-orthogonal codes over GF(2)
Discrete Mathematics
1972
180
48
Asymptotic lower bounds for Ramsey functions
Discrete Mathematics
1977
180
49
A fast algorithm for proving terminating hypergeometric identities
Discrete Mathematics
1990
179
50
Dense packings of congruent circles in a circle
Discrete Mathematics
1998
178
site/software ©
exaly
; All materials licenced under
CC by-SA
.