Simplicial complexes connect topology to graph theory, and, like hypergraphs, they raise compelling mathematical questions that will drive future investigations.

In theory, it cannot be ruled out that the algorithms might run for longer than the age of the universe. But in practice, many algorithms seem to work just fine. Almost always.

Solving sudoku puzzles may not require mathematics, but mathematicians have found plenty to say about the popular brainteasers.

Thomas E. Dilts, Peter J. Weisberg, Philip Leitner, Marjorie D. Matocq, Richard D. Inman, Kenneth E. Nussear, Todd C. Esque, Multiscale connectivity and graph theory ...

Chemical Graph Theory and Topological Indices Publication Trend The graph below shows the total number of publications each year in Chemical Graph Theory and Topological Indices.