- Tytuł:
- 4-chromatic Koester graphs
- Autorzy:
-
Dobrynin, Andrey
Mel'nikov, Leonid - Powiązania:
- https://bibliotekanauki.pl/articles/743274.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
planar graph
4-critical graph
Grötzsch-Sachs graph
Koester graph - Opis:
- Let G be a simple 4-regular plane graph and let S be a decomposition of G into edge-disjoint cycles. Suppose that every two adjacent edges on a face belong to different cycles of S. Such a graph G arises as a superposition of simple closed curves in the plane with tangencies disallowed. Studies of coloring of graphs of this kind were originated by Grötzsch. Two 4-chromatic graphs generated by circles in the plane were constructed by Koester in 1984 [10,11,12]. Until now, no other examples of such graphs were known. We present fourteen new 4-chromatic graphs generated by circles in the plane.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 4; 617-627
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł