Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 3, p. 521.
Voir la notice de l'article dans European Digital Mathematics Library
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?
Classification :
05C10, 05C15
Mots-clés : plane graph, parity partition, edge coloring, facial parity edge coloringfacial, facially proper parity edge coloring
Mots-clés : plane graph, parity partition, edge coloring, facial parity edge coloringfacial, facially proper parity edge coloring
@article{DMGT_2013__33_3_268185, author = {J\'ulius Czap and Zsolt Tuza}, title = {Decompositions of {Plane} {Graphs} {Under} {Parity} {Constrains} {Given} by {Faces}}, journal = {Discussiones Mathematicae Graph Theory}, pages = {521}, publisher = {mathdoc}, volume = {33}, number = {3}, year = {2013}, zbl = {1275.05014}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_3_268185/} }
TY - JOUR AU - Július Czap AU - Zsolt Tuza TI - Decompositions of Plane Graphs Under Parity Constrains Given by Faces JO - Discussiones Mathematicae Graph Theory PY - 2013 SP - 521 VL - 33 IS - 3 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_3_268185/ LA - en ID - DMGT_2013__33_3_268185 ER -
Július Czap; Zsolt Tuza. Decompositions of Plane Graphs Under Parity Constrains Given by Faces. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 3, p. 521. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_3_268185/