Decompositions of plane graphs under parity constrains given by faces

Július Czap, Z. Tuza

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

An edge coloring of a plane graph G is facially proper if no two face-adjacent 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?

Original languageEnglish
Pages (from-to)521-530
Number of pages10
JournalDiscussiones Mathematicae - Graph Theory
Volume33
Issue number3
DOIs
Publication statusPublished - 2013

Fingerprint

Plane Graph
Edge Coloring
Coloring
Parity
Face
Color
Decomposition
Decompose
Odd number
Adjacent
Integer

Keywords

  • Edge coloring
  • Parity partition
  • Plane graph

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

Decompositions of plane graphs under parity constrains given by faces. / Czap, Július; Tuza, Z.

In: Discussiones Mathematicae - Graph Theory, Vol. 33, No. 3, 2013, p. 521-530.

Research output: Contribution to journalArticle

@article{faeb798025c943dfa8f9858659da9186,
title = "Decompositions of plane graphs under parity constrains given by faces",
abstract = "An edge coloring of a plane graph G is facially proper if no two face-adjacent 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?",
keywords = "Edge coloring, Parity partition, Plane graph",
author = "J{\'u}lius Czap and Z. Tuza",
year = "2013",
doi = "10.7151/dmgt.1690",
language = "English",
volume = "33",
pages = "521--530",
journal = "Discussiones Mathematicae - Graph Theory",
issn = "1234-3099",
publisher = "University of Zielona Gora",
number = "3",

}

TY - JOUR

T1 - Decompositions of plane graphs under parity constrains given by faces

AU - Czap, Július

AU - Tuza, Z.

PY - 2013

Y1 - 2013

N2 - An edge coloring of a plane graph G is facially proper if no two face-adjacent 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?

AB - An edge coloring of a plane graph G is facially proper if no two face-adjacent 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?

KW - Edge coloring

KW - Parity partition

KW - Plane graph

UR - http://www.scopus.com/inward/record.url?scp=84882311185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84882311185&partnerID=8YFLogxK

U2 - 10.7151/dmgt.1690

DO - 10.7151/dmgt.1690

M3 - Article

VL - 33

SP - 521

EP - 530

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

SN - 1234-3099

IS - 3

ER -