Graphs and Combinatorics (GC)

Graphs and Combinatorics focuses on original contributions in theoretical discrete mathematics, especially where graph theory and combinatorial ideas intersect. Central topics include graph coloring, extremal graph problems, structural graph theory, random and probabilistic methods, algebraic and enumerative combinatorics, graph algorithms, and discrete optimization. The journal also welcomes work on geometric combinatorics, topological graph theory, design theory, and combinatorial aspects of computation. Articles range from deep theoretical advances to comprehensive survey articles that synthesize current knowledge and propose new research directions. Many contributions explore connections between combinatorial structures and other mathematical fields such as number theory, algebra, geometry, and theoretical computer science. Through rigorous peer review and international editorial oversight, Graphs and Combinatorics contributes to the vibrant development of discrete mathematical theories that underpin complex systems, network analysis, and algorithmic foundations in mathematics and computing. Its readership comprises researchers, faculty, and graduate students seeking cutting‑edge results and methodologies in mathematics’s discrete and structural domains.

Graphs and Combinatorics (GC) is :-

• International, Peer-Reviewed, Open Access, Refereed, Discrete Mathematics and Combinatorics, Theoretical Computer Science, graph coloring, extremal graph problems, structural graph theory, random and probabilistic methods, algebraic and enumerative combinatorics, graph algorithms, discrete optimization, he journal also welcomes work on geometric combinatorics, topological graph theory, design theory, combinatorial aspects of computation , Online or Print , Bi-Monthly Journal

• UGC Approved, ISSN Approved: P-ISSN P-ISSN: 0911-0119, E-ISSN: 1435-5914, Established: 1985, Impact Factor: 0.6
• Does Not Provide Crossref DOI

• Not indexed in Scopus, WoS, DOAJ, PubMed, UGC CARE