- 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ł