The graph below shows the total number of publications each year in Graph Coloring and Planar Graphs. References [1] 2-Distance Choosability of Planar Graphs with a Restriction for Maximum Degree .

Conflict-free colouring represents a rapidly evolving area of combinatorial optimisation with significant implications for both theoretical research and practical applications. In this framework ...

The Exascale Computing Project has selected its fifth Co-Design Center to focus on Graph Analytics — combinatorial (graph) kernels that play a crucial enabling role in many data analytic computing ...