Temat: Parity - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Autorzy:: Czap, Július
Tuza, Zsolt
Powiązania:: https://bibliotekanauki.pl/articles/30146456.pdf
Data publikacji:: 2013-07-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: plane graph
parity partition
edge coloring
Opis:: An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each color c and each face f of G, either an odd number of edges incident with f is colored with c, or color c does not occur on the edges of f. In this paper we deal with the following question: For which integers k does there exist a facial (facially proper) parity edge coloring of a plane graph G with exactly k colors?
Źródło:: Discussiones Mathematicae Graph Theory; 2013, 33, 3; 521-530
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Colouring vertices of plane graphs under restrictions given by faces
Autorzy:: Czap, Július
Jendrol', Stanislav
Powiązania:: https://bibliotekanauki.pl/articles/744449.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: vertex colouring
plane graph
weak parity vertex colouring
strong parity vertex colouring
proper colouring
Lebesgue theorem
Opis:: We consider a vertex colouring of a connected plane graph G. A colour c is used k times by a face α of G if it appears k times along the facial walk of α. We prove that every connected plane graph with minimum face degree at least 3 has a vertex colouring with four colours such that every face uses some colour an odd number of times. We conjecture that such a colouring can be done using three colours. We prove that this conjecture is true for 2-connected cubic plane graphs. Next we consider other three kinds of colourings that require stronger restrictions.
Źródło:: Discussiones Mathematicae Graph Theory; 2009, 29, 3; 521-543
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: On the strong parity chromatic number
Autorzy:: Czap, Július
Jendroľ, Stanislav
Kardoš, František
Powiązania:: https://bibliotekanauki.pl/articles/743985.pdf
Data publikacji:: 2011
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: plane graph
k-planar graph
vertex colouring
strong parity vertex colouring
Opis:: A vertex colouring of a 2-connected plane graph G is a strong parity vertex colouring if for every face f and each colour c, the number of vertices incident with f coloured by c is either zero or odd. Czap et al. in [9] proved that every 2-connected plane graph has a proper strong parity vertex colouring with at most 118 colours. In this paper we improve this upper bound for some classes of plane graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2011, 31, 3; 587-600
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja