ISSN: 0364-9024

Journal Home

Journal Guideline

Journal of Graph Theory Q1 Unclaimed

Wiley-Liss Inc. United States

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

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

Type: Journal

Type of Copyright:

Languages: English

Open Access Policy: Open Choice

Type of publications:

Publication frecuency: -

Categories: Discrete Mathematics and Combinatorics (Q1) Geometry and Topology (Q1)

Price

2400 €

Inmediate OA

NPD

Embargoed OA

0 €

Non OA

Metrics

1,17

SJR Impact factor

56

H Index

146

Total Docs (Last Year)

332

Total Docs (3 years)

2939

Total Refs

336

Total Cites (3 years)

332

Citable Docs (3 years)

0.94

Cites/Doc (2 years)

20.13

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

Geometric and Functional Analysis Q1
Forum of Mathematics, Pi Q1
Journal of Differential Geometry Q1
Geometry and Topology Q1
Journal of Algebraic Geometry Q1

Compare this journals

Aims and Scope

Best articles by citations

Weakening arcs in tournaments

On graph invariants satisfying the deletion-contraction formula

On the size of graphs labeled with a condition at distance two

Minimal non-neighborhood-perfect graphs

A ramsey-type bound for rectangles

Lower bounds on the number of triangles in a graph

Weakly Hamiltonian-connected locally semicomplete digraphs

Constrained Ramsey numbers of graphs

s-Regular cubic graphs as coverings of the complete bipartite graphK3,3

Fast generation of cubic graphs

Characterization of graphs with hall number 2

Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications

SHOW MORE ARTICLES

An extremal function for digraph subcontraction

A short proof of a theorem on Hamiltonian graphs

Some results on graphs without long induced paths

Locally semicomplete digraphs that are complementarym-pancyclic

On ?-equivalence and ?-equivalence of graphs

On the number of quasi-kernels in digraphs

Judicious partitions of bounded-degree graphs

Hamilton Cycles, Minimum Degree, and Bipartite Holes

Hamilton decompositions of complete multipartite graphs with any 2-factor leave

Walks through every edge exactly twice II

Rainbow spanning trees in complete graphs colored by one-factorizations

A characterization of ?-outerplanar graphs