Discrete Mathematics
Discrete Mathematics is a journal indexed in SJR in Discrete Mathematics and Combinatorics and Theoretical Computer Science with an H index of 92. It has an SJR impact factor of 0,884 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,884.
Discrete Mathematics focuses its scope in these topics and keywords: theorem, vertices, codes, proof, trees, cycles, diracs, dixons, simple, treesa, ...
Unclaimed profile — some fields may be incomplete.
Metrics
Campos Scimago / CoP — sin series inventadas
SJR Impact
0,884
H-index
92
Docs (year)
453
Docs 3y
1222
Total refs
8977
Cites 3y
1247
Citable 3y
1221
Cites/Doc 2y
1.04
Ref/Doc
19.82
Immediate OA
—
Embargoed OA
NPD
Non OA / Submission
0 €
Name good journals. Call out predatory ones.
Share what peer review, fees, and timelines were really like. Praise fair editors. Flag APC traps, fake metrics, or spam solicitations — with facts from your submission.
Researcher reviews
Best articles by citations
Arrangements of hemispheres and halfspaces
View moreTwistors bridges among 3-manifolds
View moreContractible circuits in 3-connected graphs
View moreConnected coverings and an application to oriented matroids
View moreCongruences for a restricted m-ary partition function
View moreColoring of integer distance graphs
View moreClassification of binary/ternary one-error-correcting codes
View moreChromatically unique bipartite graphs with low 3-independent partition numbers
View moreChromatic equivalence classes of certain generalized polygon trees
View moreBisingular maps on the sphere and the projective plane
View moreBideterminants, arborescences and extension of the Matrix-Tree theorem to semirings
View moreBelyi functions for Archimedean solids
View moreBalanced k-colorings
View moreA bijection on Dyck paths and its consequences (note) [discrete math. 179 (1998) 253-256]
View moreAn extremal problem concerning graphs not containing Kt and Kt,n-t
View moreAn extremal connectivity parameter of tournaments
View moreAn Euler-type formula for median graphs
View moreAdditive compound graphs
View moreAcyclic graphoidal covers and path partitions in a graph
View moreA strongly polynomial algorithm for the minimum cost tension problem
View moreA proof of the Beyer-Stein-Ulam relation between complexity and entropy
View moreA new upper bound for binary codes with minimum distance four
View moreA Howell design admitting A51
View moreA classification of centrally-symmetric and cyclic 12-vertex triangulations of S2?oS2
View more