Promote Sponsor
verified SJR 0,884 · Q1 • database Scopus / SJR & Web of Science indexed
Discrete Mathematics
Netherlands · Elsevier B.V.
workspace_premium Q1 — Discrete Mathematics and Combinatorics lock_open Open Access Unclaimed

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, ...

ISSN: 0012-365X
Editorial: Elsevier B.V.
Category: Discrete Mathematics and Combinatorics
Indexation: verifiedScopus / SJR verifiedWeb of Science

Unclaimed profile — some fields may be incomplete.

open_in_new Portal NPD menu_book Guidelines NPD
schedule Datos CoP · solo campos en BD
SJR Impact Factor trending_up
0,884 Q1
H-index 92
Tasa de Aceptación pie_chart
26% Selectiva
Fuente Acceptance_Rate
Tiempo a publicación hourglass_top
NPD
Campo Sin dato
Coste de Publicación (APC) payments
NPD Open Access
Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

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 €

shield Researcher voice

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.

Fair & fast peer review Clear APC / no surprise fees Suspected predatory Fake impact claims
rate_review Write an honest review

Researcher reviews

sentiment_dissatisfied No reviews yet — be the first to share an honest experience.
User
* Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Arrangements of hemispheres and halfspaces

View more

Twistors bridges among 3-manifolds

View more

Contractible circuits in 3-connected graphs

View more

Connected coverings and an application to oriented matroids

View more

Congruences for a restricted m-ary partition function

View more

Coloring of integer distance graphs

View more

Classification of binary/ternary one-error-correcting codes

View more

Chromatically unique bipartite graphs with low 3-independent partition numbers

View more

Chromatic equivalence classes of certain generalized polygon trees

View more

Bisingular maps on the sphere and the projective plane

View more

Bideterminants, arborescences and extension of the Matrix-Tree theorem to semirings

View more

Belyi functions for Archimedean solids

View more
SHOW MORE ARTICLES

Balanced k-colorings

View more

A bijection on Dyck paths and its consequences (note) [discrete math. 179 (1998) 253-256]

View more

An extremal problem concerning graphs not containing Kt and Kt,n-t

View more

An extremal connectivity parameter of tournaments

View more

An Euler-type formula for median graphs

View more

Additive compound graphs

View more

Acyclic graphoidal covers and path partitions in a graph

View more

A strongly polynomial algorithm for the minimum cost tension problem

View more

A proof of the Beyer-Stein-Ulam relation between complexity and entropy

View more

A new upper bound for binary codes with minimum distance four

View more

A Howell design admitting A51

View more

A classification of centrally-symmetric and cyclic 12-vertex triangulations of S2?oS2

View more

FAQS