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 ...

The questions in this quiz are suitable for GCSE maths students studying quadratic graphs, cubic graphs, reciprocal graphs, exponential graphs - Higher, The equation of a circle - Higher,the equation ...

If true, the following conjecture of Thomassen [Th81] is a planarity criterion for a special class of graphs that involves only K 5. Recall that a planar graph on n vertices contains at most 3n-6 ...

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].

A function is a rule that is applied to one set of values to give another set of values. A function can be illustrated on a graph – points are plotted as coordinates and joined by either a straight ...