Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science. These graphs are not only central ...

Conjecture (Berge and Fulkerson): Every 2-connected cubic graph has a collection of six perfect matchings that together cover every edge exactly twice. This conjecture is attributed to Berge in [2].

Instead of an excuse for the Summer delay, I start with some personal touch. At the moment of preparing this HTML file, I am sitting on the balcony of an apartment in a little (used-to-be) fisherman ...

Curved graphs can be used to solve equations. The points at which the curve crosses a particular line on the graph are the solutions to the equation. If we want to solve the equation ...