Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Erdős regular graphs of even degree

Andrey A. DobryninLeonid S. Mel'nikovArtem V. Pyatkin — 2007

Discussiones Mathematicae Graph Theory

In 1960, Dirac put forward the conjecture that r-connected 4-critical graphs exist for every r ≥ 3. In 1989, Erdös conjectured that for every r ≥ 3 there exist r-regular 4-critical graphs. A method for finding r-regular 4-critical graphs and the numbers of such graphs for r ≤ 10 have been reported in [6,7]. Results of a computer search for graphs of degree r = 12,14,16 are presented. All the graphs found are both r-regular and r-connected.

Page 1

Download Results (CSV)