- Tytuł:
- Erdős regular graphs of even degree
- Autorzy:
-
Dobrynin, Andrey
Mel'nikov, Leonid
Pyatkin, Artem - Powiązania:
- https://bibliotekanauki.pl/articles/743782.pdf
- Data publikacji:
- 2007
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
vertex coloring
4-critical graph
circulant
regular graph
vertex connectivity - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2007, 27, 2; 269-279
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł