Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Koester graph

Sortuj według:

Ogranicz wyniki do:

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

4-chromatic Koester graphs

100%

Dobrynin A., Mel'nikov L.

Discussiones Mathematicae Graph Theory

2012

tom 32

nr 4

617-627

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Dobrynin A.

1 Mel'nikov L.

1 2012

Wyniki wyszukiwania

4-chromatic Koester graphs