Facial visibility in edge colored plane graphs
type: Item
instance of: scholarly article
title: Facial visibility in edge colored plane graphs
zbMATH Open document ID: 1482.05099
author: Július Czap
author: Tomáš Madaras
author: Stanislav Jendroľ
published in: Graphs and Combinatorics
publication date: 2022-01-03T00:00:00Z
review text: The paper studies facial edge-coloring of plane graphs. A facial edge-coloring of a plane graph \(G\) is an edge-coloring that is proper on the edges of the boundary walks of its faces. A face \(f\) sees \(p\) colors, if the edges of its boundary walk are colored with \(p\) distinct colors. The facial edge-\(p\)-visibility number of a plane graph \(G\) is the maximum number \(k\) of colors such that there is a facial \(k\)-edge-coloring of \(G\) and each face of \(G\) sees at most \(p\) colors. The authors prove several general tight lower and upper bounds for this graph coloring invariant. Moreover, they determine the exact values for certain special families of plane graphs.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 7451438
zbMATH Keywords: plane graph
zbMATH Keywords: edge coloring
reviewed by: Eckhard Steffen
MaRDI profile type: Publication
full work available at URL: s00373-021-02411-9
OpenAlex ID: W4200019064
cites work: Polychromatic colorings of plane graphs
cites work: \(M_2\)-edge coloring and maximum matching of graphs
cites work: A note on M2-edge colorings of graphs
cites work: Edge looseness of plane graphs
cites work: \(M_i\)-edge colorings of graphs
cites work: \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
cites work: Facially-constrained colorings of plane graphs: a survey
cites work: Edge-coloring of plane multigraphs with many colors on facial cycles
cites work: Facial list colourings of plane graphs
cites work: M_{2}-edge colorings of dense graphs
cites work: Rainbow faces in edge‐colored plane graphs
cites work: \(\ell\)-facial edge colorings of graphs
cites work: Planar graphs of maximum degree seven are Class I
cites work: A Theorem on Coloring the Lines of a Network
cites work: Q5558480
DOI: 10.1007/S00373-021-02411-9
description: scientific article; zbMATH DE number 7451438