World's Best Scientists 2026 revealed!
Graphs and Combinatorics
H-index 8

Graphs and Combinatorics

0911-0119

Published by: Springer

https://www.springer.com/journal/373

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 326 37 70 8
Computer Science 667 25 53 8

Additional Metrics

Number of Best Scientists*: 50
Documents by Best Scientists*: 84
Top 100 Ranked Scientists*: 1
SCIMAGO H-index: 45
SCIMAGO SJR: 0.658
Impact Factor: N/A

Overview

Top Research Topics at Graphs and Combinatorics?

Graphs and Combinatorics primarily tackles Combinatorics, Discrete mathematics, Graph, Vertex (geometry) and Conjecture. Most of the works presented in Graphs and Combinatorics deals with Combinatorics but it intersects with the subject of Upper and lower bounds. Research on Discrete mathematics presented in it focuses, in particular, on Line graph, Bound graph, Complement graph, 1-planar graph and Symmetric graph.

The study on Symmetric graph presented is investigated in conjunction with research in Vertex-transitive graph. The studies on Graph discussed can also contribute to research in the domains of Disjoint sets and Chromatic scale. While work presented in it provided substantial information on Chordal graph, it also covered topics in Indifference graph and Pathwidth.

Graph toughness is part of Graph power studies tackled in the journal.

  • Combinatorics (99.58%)
  • Discrete mathematics (62.01%)
  • Graph (33.23%)

What are the most cited papers published in the journal?

  • Eigenvalues, diameter, and mean distance in graphs (261 citations)
  • The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (222 citations)
  • Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity (186 citations)

Research areas of the most cited articles at Graphs and Combinatorics:

The published papers tackle a plethora of topics, such as Combinatorics, Discrete mathematics, Graph, Chordal graph and Graph power. Most of the works presented in the most cited articles deal with Combinatorics but they intersect with the subject of Upper and lower bounds. The journal publications focus on Graph but the discussions also offer insight into other areas such as Hypergraph, Bounded function and Partition (number theory).

What topics the last edition of the journal is best known for?

  • Combinatorics
  • Algebra
  • Geometry

The previous edition focused in particular on these issues:

The journal investigates areas of study like Combinatorics, Graph, Order (ring theory), Conjecture and Degree (graph theory). Graphs and Combinatorics links adjacent topics like Combinatorics with Upper and lower bounds. The journal explores issues in Upper and lower bounds which can be linked to other research areas like Adjacency matrix and Eigenvalues and eigenvectors.

The journal focuses on Graph research which is adjacent to topics in Chromatic scale. In addition to Order (ring theory) research, it aims to explore topics under Disjoint sets and Induced subgraph. It addresses concerns in Vertex (geometry) which are intertwined with other disciplines, such as Hypergraph and Cardinality.

The most cited articles from the last journal are:

  • On the Connectivity of Enhanced Power Graphs of Finite Groups (6 citations)
  • Admissible Pinnacle Orderings (4 citations)
  • Anti-Ramsey Problems in Complete Bipartite Graphs for t Edge-Disjoint Rainbow Spanning Trees (4 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Graphs and Combinatorics (based on the number of publications) are:

  • Michael A. Henning (26 papers) published 3 papers at the last edition, 2 more than at the previous edition,
  • Noga Alon (23 papers) absent at the last edition,
  • Hong-Jian Lai (23 papers) published 3 papers at the last edition, 2 more than at the previous edition,
  • Douglas B. West (19 papers) published 1 paper at the last edition the same number as at the previous edition,
  • Jorge Urrutia (19 papers) published 1 paper at the last edition the same number as at the previous edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Graphs and Combinatorics (based on the number of publications) are:

  • Hungarian Academy of Sciences (49 papers) absent at the last edition,
  • National Autonomous University of Mexico (49 papers) published 2 papers at the last edition the same number as at the previous edition,
  • University of Illinois at Urbana–Champaign (43 papers) published 3 papers at the last edition, 1 more than at the previous edition,
  • West Virginia University (40 papers) published 3 papers at the last edition, 1 more than at the previous edition,
  • Nankai University (35 papers) published 3 papers at the last edition, 2 more than at the previous edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 5.52% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 14.29% were posted by at least one author from the top 10 institutions publishing in the journal. Another 9.09% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 12.34% of all publications and 64.29% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • On the Connectivity and Independence Number of Power Graphs of Groups

    Peter J. Cameron;Sayyed Heidar Jafari

    (2020)
    24 Citations
  • Notes on the Leonard System Classification

    Paul M. Terwilliger

    (2021)
    17 Citations
  • The Minimum Number of Edges in 4-Critical Digraphs of Given Order

    Alexandr V. Kostochka;Michael Stiebitz

    (2020)
    14 Citations
  • Super Graphs on Groups, I

    (2022)
    13 Citations
  • Strong Subgraph Connectivity of Digraphs

    Yuefang Sun;Gregory Z. Gutin

    (2021)
    12 Citations
  • Partial Skew Dyck Paths: A Kernel Method Approach

    (2021)
    12 Citations

Related Online Degrees & Career Pathways

For those interested in advancing their education quickly, exploring the best 1 year phd programs online can be a great way to earn a doctorate without the lengthy traditional timeline. These accelerated programs offer flexibility and allow students to dive deeper into specialized areas of computer science.

Similarly, if a master’s degree is the goal, the best one year masters programs provide a fast track to gain advanced skills and increase employability in tech fields. These programs combine rigorous coursework with practical experience, making graduates job-ready.

When considering career outcomes, it’s important to focus on degrees that offer strong financial returns. The highest paying online degrees list highlights computer science-related fields that can elevate earning potential quickly through online education.

Ultimately, choosing the right study path relies on understanding the options available. Reviewing popular options from the majors in college can help students align their interests with market demand and career growth opportunities in the technology sector.

Best Scientists Contributing to This Journal