Default: Discrete Mathematics

ISSN: 0012-365X

Journal Home

Journal Guideline

Discrete Mathematics Q1 Unclaimed

Elsevier B.V. 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 88. It has an SJR impact factor of 0,801 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 0,801.

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

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Price

- €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

Discrete Mathematics

0,801

SJR Impact factor

88

H Index

438

Total Docs (Last Year)

1215

Total Docs (3 years)

8894

Total Refs

1076

Total Cites (3 years)

1214

Citable Docs (3 years)

0.87

Cites/Doc (2 years)

20.31

Ref/Doc

Comments

No comments ... Be the first to comment!

Aims and Scope


identityperfect, treesa, simple, dixons, diracs, cycles, trees, proof, codes, graphsa, theorem, generalization, edgedisjoint, application, kconnected, uhproduct, circulant, vertices, spanning, graphsedgeconnectivity, k,



Best articles by citations

On the domination of hypergraphs by their edges

View more

Frequency-distance constraints with large distances

View more

Distributivity and decomposability on the lattices satisfying the chain conditions

View more

Random palindromes: multivariate generating function and Bernoulli density

View more

Homotopy in Q-polynomial distance-regular graphs

View more

Twistors bridges among 3-manifolds

View more

On semi-P4-sparse graphs

View more

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

View more

Belyi functions for Archimedean solids

View more

On intersection representations of co-planar graphs

View more

Extremal graphs with prescribed circumference and cocircumference

View more

Some results on an edge coloring problem of Folkman and Fulkerson

View more
SHOW MORE ARTICLES

On the forced unilateral orientation number of a graph

View more

A Howell design admitting A51

View more

Minimal reducible bounds for 1-nonouterplanar graphs

View more

Sequences with idempotent products from finite regular semigroups

View more

An extremal connectivity parameter of tournaments

View more

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

View more

Coloring of integer distance graphs

View more

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

View more

Remarks on Barany's theorem and affine selections

View more

Linear coloring of graphs

View more

On hamiltonian connectedness of K1,4-free graphs

View more

Dominating sets whose closed stars form spanning trees

View more

FAQS