verified SJR 1,595 · Q1 • database Scopus / SJR & Web of Science indexed

United States · Wiley-Liss Inc.

workspace_premium Q1 — Geometry and Topology lock_open Open Access Unclaimed

Journal of Graph Theory

Journal of Graph Theory is a journal indexed in SJR in Geometry and Topology with an H index of 58. It has a price of 2400 €. It has an SJR impact factor of 1,595 and it has a best quartile of Q1. It is published in English. It has an SJR impact factor of 1,595.

ISSN: 0364-9024

Editorial: Wiley-Liss Inc.

Category: Geometry and Topology

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

1,595 Q1

H-index 58

Tasa de Aceptación pie_chart

30% Selectiva

Fuente Acceptance_Rate

Tiempo a publicación hourglass_top

NPD

Campo Sin dato

Coste de Publicación (APC) payments

2.400 € Open Access

Ruta Non-OA 0 €

Metrics

Campos Scimago / CoP — sin series inventadas

Scopus / SJR Web of Science

SJR Impact

1,595

H-index

Docs (year)

131

Docs 3y

369

Total refs

2710

Cites 3y

438

Citable 3y

369

Cites/Doc 2y

1.11

Ref/Doc

20.69

Immediate OA

2400 €

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

All cycle-complete graph Ramsey numbersr(Cm,K6)

Weakly Hamiltonian-connected locally semicomplete digraphs

Density of the circular chromatic numbers of series-parallel graphs

Defective choosability of graphs with no edge-plus-independent-set minor

Cycles of given color patterns

Cycle systems of the line graph of the complete graph

Critical groups for complete multipartite graphs and Cartesian products of complete graphs

Constrained Ramsey numbers of graphs

Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set

Classification of certain subgraphs of the 3-dimensional grid

Characterization of graphs with hall number 2

Bi-arc graphs and the complexity of list homomorphisms

SHOW MORE ARTICLES

An extremal function for digraph subcontraction

2-factors in triangle-free graphs

A Steiner triple system which colors all cubic graphs

A short proof of a theorem on Hamiltonian graphs

A ramsey-type bound for rectangles

A partition approach to Vizing's conjecture

A new characterization of graphs based on interception relations

A lower bound for groupies in graphs

A list analogue of equitable coloring

A Gallai-Edmonds-type structure theorem for path-matchings

A characterization of panconnected graphs satisfying a local ore-type condition

A characterization of ?-outerplanar graphs

FAQS

In Country of Papers you can find SJR impact factor and other metrics to help you decide on a Journal.