Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: vertex connectivity

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Erdős regular graphs of even degree

100%

Dobrynin A., Mel'nikov L., Pyatkin A.

Discussiones Mathematicae Graph Theory

2007

tom 27

nr 2

269-279

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Dobrynin A.

1 Mel'nikov L.

1 Pyatkin A.

1 2007

Wyniki wyszukiwania

Erdős regular graphs of even degree