ISSN: 0012-365X
Journal Home
Journal Guideline
Discrete Mathematics Q1 Unclaimed
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: -
- €
Inmediate OANPD
Embargoed OA0 €
Non OAMetrics
0,801
SJR Impact factor88
H Index438
Total Docs (Last Year)1215
Total Docs (3 years)8894
Total Refs1076
Total Cites (3 years)1214
Citable Docs (3 years)0.87
Cites/Doc (2 years)20.31
Ref/DocOther journals with similar parameters
Forum of Mathematics, Pi Q1
Journal of Combinatorial Theory. Series B Q1
Forum of Mathematics, Sigma Q1
Journal of Computational and Graphical Statistics Q1
Annales de l'Institut Henri Poincare (D) Combinatorics, Physics and their Interactions Q1
Compare this journals
Aims and Scope
Best articles by citations
On the domination of hypergraphs by their edges
View moreFrequency-distance constraints with large distances
View moreDistributivity and decomposability on the lattices satisfying the chain conditions
View moreRandom palindromes: multivariate generating function and Bernoulli density
View moreHomotopy in Q-polynomial distance-regular graphs
View moreTwistors bridges among 3-manifolds
View moreOn semi-P4-sparse graphs
View moreLimit shape of convex lattice polygons having the minimal L8 diameter w.r.t. the number of their vertices
View moreBelyi functions for Archimedean solids
View moreOn intersection representations of co-planar graphs
View moreExtremal graphs with prescribed circumference and cocircumference
View moreSome results on an edge coloring problem of Folkman and Fulkerson
View moreOn the forced unilateral orientation number of a graph
View moreA Howell design admitting A51
View moreMinimal reducible bounds for 1-nonouterplanar graphs
View moreSequences with idempotent products from finite regular semigroups
View moreAn extremal connectivity parameter of tournaments
View moreOn the number of large h-hypergraphs with a fixed diameter
View moreColoring of integer distance graphs
View moreAn extremal problem concerning graphs not containing Kt and Kt,n-t
View moreRemarks on Barany's theorem and affine selections
View moreLinear coloring of graphs
View moreOn hamiltonian connectedness of K1,4-free graphs
View moreDominating sets whose closed stars form spanning trees
View more
Comments