Electronic Journal of Combinatorics | 2024 Cite Score:1.3 | Q1

Cite Score and Journal Rank of Electronic Journal of Combinatorics

• About: The Electronic Journal of Combinatorics (EJC) is a peer-reviewed open-access journal dedicated to the field of combinatorics. It provides a platform for the dissemination of significant research results and advances in combinatorial mathematics. The journal covers a broad spectrum of topics within combinatorics and its applications, offering researchers a venue for sharing their findings with the global scientific community.
• Objective
  The primary objective of EJC is to promote the advancement of combinatorial mathematics by publishing high-quality research articles that address both theoretical and applied aspects of the field. The journal aims to foster collaboration and communication among researchers and practitioners in combinatorics and related disciplines.
• Topics Covered
  EJC covers a wide range of topics in combinatorics, including but not limited to: Graph theory and network theory Design theory and combinatorial designs Enumeration and generating functions Combinatorial optimization Extremal combinatorics Probabilistic combinatorics Combinatorial algorithms and complexity Combinatorial geometry Algebraic combinatorics Random structures and processes Applications of combinatorics in other fields such as computer science, operations research, and biology
• Interdisciplinary Approach
  The journal adopts an interdisciplinary approach, encouraging contributions from various fields where combinatorial techniques and methods are applied. This cross-disciplinary focus allows EJC to address a wide range of problems and applications, promoting the integration of combinatorial methods with other scientific and engineering disciplines.
• Impact and Significance
  EJC is recognized for its contribution to the advancement of combinatorial mathematics. By publishing high-quality research and innovative methods, the journal influences both theoretical developments and practical applications in the field. It serves as a valuable resource for researchers, academics, and practitioners who are involved in combinatorial studies and applications.
• Submission and Review Process
  EJC follows a rigorous peer-review process to ensure the quality and relevance of its publications. Researchers are encouraged to submit original research articles, surveys, and expository papers that contribute to the advancement of combinatorics. The journal provides an open-access platform, ensuring that all published articles are freely available to the global research community.

• Journal Home:  Journal Homepage

• Editor-in-Chief:  Maria Axenovich

• Scope: The Electronic Journal of Combinatorics (E-JC) is a peer-reviewed, open-access journal that publishes high-quality research papers in the field of combinatorics. Established in 1994, the journal has gained a strong reputation for disseminating important advancements in combinatorial mathematics and its applications.
• Graph Theory:
  Structural Graph Theory: Research on the properties, structures, and classifications of various types of graphs, including planar graphs, bipartite graphs, and hypergraphs.
• Graph Algorithms: Studies on algorithms for graph-related problems, such as graph coloring, graph matching, and network flow problems.
• Graph Embeddings: Exploration of ways to embed graphs in surfaces and other spaces, including studies on topological graph theory.
• Extremal Graph Theory: Research on extremal properties of graphs, such as the maximum or minimum number of edges under certain conditions.
• Enumerative Combinatorics:
  Counting Problems: Studies focused on counting the number of combinatorial structures, such as permutations, combinations, partitions, and subsets.
• Generating Functions: Research on the use of generating functions to solve combinatorial enumeration problems.
• Bijective Combinatorics: Exploration of bijections between combinatorial structures, which provide insights into the relationships between different combinatorial objects.
• Polynomials in Combinatorics: Research on the role of polynomials, such as chromatic polynomials and Tutte polynomials, in combinatorial problems.
• Design Theory:
  Combinatorial Designs: Research on the construction and analysis of combinatorial designs, including block designs, Latin squares, and finite geometries.
• Coding Theory: Studies on the application of combinatorial designs to coding theory, including error-correcting codes and cryptographic codes.
• Experimental Design: Exploration of the use of combinatorial methods in the design and analysis of experiments in various scientific fields.
• Applications of Design Theory: Research on the practical applications of combinatorial designs in areas such as telecommunications, computer science, and biology.
• Algebraic Combinatorics:
  Group Actions in Combinatorics: Studies on the use of group theory to solve combinatorial problems, including the study of permutation groups and their applications.
• Combinatorial Representations: Research on the representation theory of algebraic structures and its connections to combinatorial problems.
• Symmetric Functions and Schur Functions: Exploration of the role of symmetric functions in combinatorial problems, including applications to representation theory and partition theory.
• Combinatorial Hopf Algebras: Research on the combinatorial aspects of Hopf algebras and their applications to various areas of mathematics.
• Geometric Combinatorics:
  Polytopes and Convex Geometry: Studies on the combinatorial properties of polytopes, including their face lattices and connections to convex geometry.
• Arrangements of Hyperplanes: Research on the combinatorial and topological properties of hyperplane arrangements and their applications.
• Toric Varieties and Combinatorics: Exploration of the connections between toric varieties in algebraic geometry and combinatorial structures such as polytopes and fans.
• Discrete and Computational Geometry: Research on problems at the intersection of combinatorics and geometry, including studies on tilings, triangulations, and packing problems.
• Probabilistic Combinatorics:
  Random Graphs: Studies on the properties of random graphs, including phase transitions, connectivity, and the behavior of random processes on graphs.
• Probabilistic Methods: Research on the use of probabilistic techniques to prove combinatorial results, including the probabilistic method and concentration inequalities.
• Stochastic Processes in Combinatorics: Exploration of stochastic processes and their applications to combinatorial problems, such as random walks and branching processes.
• Applications of Probability to Combinatorial Optimization: Research on the use of probabilistic methods in solving combinatorial optimization problems.
• Latest Research Topics for PhD in Computer Science

• Print ISSN:  10778926

  Electronic ISSN:  10971440

• Abstracting and Indexing:  Scopus

• Imapct Factor :  

• Subject Area and Category:   Computer Science, Computational Theory and Mathematics, Mathematics, Applied Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Theoretical Computer Science

• Publication Frequency:  

• H Index:  57

• Best Quartile:

  Q1:  Applied Mathematics

  Q2:  

  Q3:  

  Q4:  

• Cite Score:  1.3

• SNIP:  1.148

• Journal Rank(SJR):  0.897

• Latest Articles:   Latest Articles in Electronic Journal of Combinatorics

• Guidelines for Authors: Electronic Journal of Combinatorics Author Guidelines

• Paper Submissions: Paper Submissions in Electronic Journal of Combinatorics

• Publisher:  Electronic Journal of Combinatorics

  Country:  United States

• Paper Writing Services - S-Logix
• Paper Publication Support - S-Logix