Session Tracks

This track focuses on the latest developments in graph algorithms, emphasizing both theoretical advancements and practical applications. Researchers are invited to present novel algorithms that improve efficiency or solve previously intractable problems.

This session will explore the boundaries of extremal graph theory, examining the maximum or minimum properties of graphs under various constraints. Contributions that provide new insights or results in this area are highly encouraged.

This track will delve into the study of random graphs, including their structural properties and applications in real-world scenarios. Papers that bridge theoretical findings with practical implications are particularly welcome.

This session aims to highlight the intersection of algebra and graph theory, focusing on how algebraic methods can be applied to solve graph-theoretic problems. Contributions that utilize algebraic techniques to derive new results are encouraged.

This track will cover the theory and applications of graph coloring, including algorithms and complexity issues. Researchers are invited to share innovative approaches and applications in various fields such as scheduling and resource allocation.

This session will focus on the topological aspects of graph theory, exploring how topological properties influence graph structures and behaviors. Contributions that connect topology with combinatorial properties are particularly sought after.

This track will investigate the computational complexity of various graph-theoretic problems, including NP-hardness and approximation algorithms. Papers that propose new complexity results or efficient algorithms are highly encouraged.

This session will explore graph invariants, focusing on their theoretical significance and practical applications in network analysis. Researchers are invited to present new invariants or innovative uses of existing ones.

This track will examine the dynamics of graph structures and their evolution over time, including models of growth and decay. Contributions that provide new theoretical frameworks or empirical studies are welcome.

This session will explore the relationship between combinatorial designs and graph theory, highlighting how graph-theoretic concepts can inform the construction of combinatorial structures. Papers that present novel designs or theoretical insights are encouraged.

This track will focus on the application of graph theory to solve real-world problems across various domains, including computer science, biology, and social networks. Researchers are invited to share case studies and innovative applications that demonstrate the utility of graph-theoretic methods.