ISSN: 0012-365X

Journal Home

Journal Guideline

Discrete Mathematics Q1 Unclaimed

Elsevier Netherlands

Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

Discrete Mathematics is a journal indexed in SJR in Discrete Mathematics and Combinatorics and Theoretical Computer Science with an H index of 83. It has an SJR impact factor of 0,794 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,794.

Discrete Mathematics focuses its scope in these topics and keywords: theorem, vertices, codes, proof, trees, cycles, diracs, dixons, simple, treesa, ...

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Discrete Mathematics and Combinatorics (Q1) Theoretical Computer Science (Q2)

Price

- €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

0,794

SJR Impact factor

83

H Index

421

Total Docs (Last Year)

1127

Total Docs (3 years)

8406

Total Refs

1017

Total Cites (3 years)

1126

Citable Docs (3 years)

0.85

Cites/Doc (2 years)

19.97

Ref/Doc

Comments

No comments ... Be the first to comment!

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID *

* The email or ORCID field is only to validate the authenticity of the comment, the identity will not be public. .

Other journals with similar parameters

Forum of Mathematics, Pi Q1
Journal of Combinatorial Theory. Series B Q1
Journal of Computational and Graphical Statistics Q1
Combinatorica Q1
Forum of Mathematics, Sigma Q1

Compare this journals

Aims and Scope

Best articles by citations

On the domination of hypergraphs by their edges

Frequency-distance constraints with large distances

Distributivity and decomposability on the lattices satisfying the chain conditions

Random palindromes: multivariate generating function and Bernoulli density

Homotopy in Q-polynomial distance-regular graphs

Twistors bridges among 3-manifolds

On semi-P4-sparse graphs

Limit shape of convex lattice polygons having the minimal L8 diameter w.r.t. the number of their vertices

Belyi functions for Archimedean solids

On intersection representations of co-planar graphs

Extremal graphs with prescribed circumference and cocircumference

Some results on an edge coloring problem of Folkman and Fulkerson

SHOW MORE ARTICLES

On the forced unilateral orientation number of a graph

A Howell design admitting A51

Minimal reducible bounds for 1-nonouterplanar graphs

Sequences with idempotent products from finite regular semigroups

An extremal connectivity parameter of tournaments

On the number of large h-hypergraphs with a fixed diameter

Coloring of integer distance graphs

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

Remarks on Barany's theorem and affine selections

Linear coloring of graphs

On hamiltonian connectedness of K1,4-free graphs

Dominating sets whose closed stars form spanning trees