Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Graph labeling is a central topic in combinatorial optimisation that involves assigning numerical or categorical labels to vertices or edges of a graph subject to specific constraints. This framework ...

A couple of weeks ago, I attended and spoke at the first stop in the Neo4j GraphTour in Washington D.C. and I was able to get the best answer yet to a question that I’d been pondering: what’s the ...

This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...

I'm wrapping up a discrete math course for my university. The last chapter gave us an introduction to graph theory, and I want to learn more. The chapter in question introduced some basic concepts: ...

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...

KOCHI: The Department of Mathematics, Cusat, will conduct an 'International conference on recent trends in graph theory and combinatorics', ICRTGC2010, from August 1215 at the IMA House in Kaloor.

When you get stuck on a fiendishly difficult sudoku, it’s hard not to wonder if the puzzle really has a solution. At another moment, aglow in the triumph of a clever deduction, you might have a ...

*Note: This course description is only applicable for the Computer Science Post-Baccalaureate program. Additionally, students must always refer to course syllabus for the most up to date information.