verified SJR 0,658 · Q2 • database Scopus / SJR & Web of Science indexed

Japan · Springer Japan

workspace_premium Q2 — Discrete Mathematics and Combinatorics lock Subscription

Graphs and Combinatorics

Graphs and Combinatorics is a journal indexed in SJR in Discrete Mathematics and Combinatorics and Theoretical Computer Science with an H index of 45. It has a price of 2090 €. It has an SJR impact factor of 0,658 and it has a best quartile of Q2. It is published in English. It has an SJR impact factor of 0,658.

ISSN: 0911-0119

Publisher: Springer Japan

Category: Discrete Mathematics and Combinatorics

Indexation: verifiedScopus / SJR verifiedWeb of Science

open_in_new Portal NPD menu_book Guidelines NPD

schedule CountryOfPapers database fields

SJR Impact Factor trending_up

0,658 Q2

H-index 45

Acceptance rate pie_chart

33%

Source Acceptance_Rate

Time to publication hourglass_top

NPD

Field NPD

Publication cost (APC) payments

2.090 € Subscription

Non-OA path 0 €

Metrics

Scimago and CountryOfPapers database fields

Scopus / SJR Web of Science

SJR Impact

0,658

H-index

Docs (year)

133

Docs 3y

480

Total refs

2350

Cites 3y

345

Citable 3y

479

Cites/Doc 2y

0.67

Ref/Doc

17.67

Immediate OA

2090 €

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.

Publication speed *

Review quality *

Edition and editorial team *

Institutional email or ORCID * * Only to validate authenticity — identity is not shown publicly.

Best articles by citations

Bipartite Q -Polynomial Distance-Regular Graphs

Zero-Sum

Diagonal Flips in Labelled Planar Triangulations

Cycles through three vertices in 2-connected graphs

Current research on algebraic combinatorics

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems

Construction of hadamard matrices of order 28

Codes with given distances

Codes for Identification in the King Lattice

Claude Berge: 5.6.1926-30.6.2002

Chromatic Polynomials and the Symmetric Group

Characters of Association Schemes and Normal Closed Subsets

SHOW MORE ARTICLES

Bipartite Subgraphs of Graphs with Maximum Degree Three

0-Dual Closures for Several Classes of Graphs

Bipartite Distance-regular Graphs, Part I

Asymptotic Upper Bounds for Ramsey Functions

An Enhanced Arimoto Theorem on Threshold Transformations

An Analogue of Haj's' Theorem for the Circular Chromatic Number (II)

An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter

A Theorem About Elementary Cuts and Flow Polynomials

A Sufficient Condition for a Graph to Have a k-tree

A Linear Heterochromatic Number of Graphs

A correlation inequality for bipartite graphs

A Coding Theory Bound and Zero-Sum Square Matrices

FAQs

Graphs and Combinatorics has an SJR of 0,658 (best quartile Q2) in the CountryOfPapers database.

Immediate OA APC is 2090 EUR. Non-OA / submission fee is 0 EUR.

The acceptance rate recorded for Graphs and Combinatorics is 33%.

Graphs and Combinatorics

Metrics

Name good journals. Call out predatory ones.

Researcher reviews

Best articles by citations

FAQs

What is the SJR of Graphs and Combinatorics?

What is the APC / publication cost?

What is the acceptance rate?