Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: parity partition

Sortuj według:

Ogranicz wyniki do:

Decompositions of Plane Graphs Under Parity Constrains Given by Faces

100%

Czap J., Tuza Z.

Discussiones Mathematicae Graph Theory

2013

tom 33

nr 3

521-530

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?

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Czap J.

1 Tuza Z.

1 2013

Wyniki wyszukiwania

Decompositions of Plane Graphs Under Parity Constrains Given by Faces