Facial parity 9-edge-coloring of outerplane graphs
type: Item
instance of: scholarly article
title: Facial parity 9-edge-coloring of outerplane graphs
zbMATH Open document ID: 1326.05034
author: Tomáš Bálint
author: Július Czap
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
review text: A connected graph containing no bridge is said to be 2-edge-connected. A facial parity edge coloring of a 2-edge-connected plane graph \(G\) is an edge coloring satisfying the following two conditions: (1) face-adjacent edges of \(G\) receive different colors, and (2) for every color \(c\) and every face f of \(G\), the total number of occurrences of edges colored with \(c\) on a facial trail of \(f\) is odd or zero. It is shown that the minimum number of colors used in coloring any 2-edge-connected outerplane graph \(G\) is less than 10. Furthermore, it is also shown that this bound is tight.
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6484800
zbMATH Keywords: plane graph
zbMATH Keywords: edge-coloring
zbMATH Keywords: 2-edge-connected
zbMATH Keywords: outerplane graph
MaRDI profile type: Publication
full work available at URL: s00373-014-1472-7
OpenAlex ID: W1964210193
cites work: Q5422499
cites work: Optimal strong parity edge-coloring of complete graphs
cites work: Q5443201
cites work: Facial parity edge coloring of outerplane graphs
cites work: Facial parity edge colouring
cites work: Facial parity edge colouring of plane pseudographs
cites work: Q4121921
cites work: Improved bound on facial parity edge coloring
DOI: 10.1007/S00373-014-1472-7
description: scientific article; zbMATH DE number 6484800