Improved bounds for some facially constrained colorings

DOI10.7151/dmgt.2357zbMath1506.05078arXiv2005.09979OpenAlexW3102720887MaRDI QIDQ2107748

Kenny Štorgel

Publication date: 2 December 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.09979

zbMATH Keywords

plane graphfacial coloringWORM coloringfacial-parity edge-coloringfacial-parity vertex-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

A survey on the cyclic coloring and its relaxations

Cites Work

• Improved bound on facial parity edge coloring
• Parity vertex coloring of outerplane graphs
• Vertex coloring without large polychromatic stars
• Facial parity edge colouring of plane pseudographs
• An improved bound on parity vertex colourings of outerplane graphs
• WORM colorings of planar graphs
• Parity vertex colouring of plane graphs
• Facially-constrained colorings of plane graphs: a survey
• \(F\)-WORM colorings: results for 2-connected graphs
• Worm colorings
• Colorings of plane graphs without long monochromatic facial paths
• 3-consecutive C-colorings of graphs
• Facial parity edge colouring
• Graph colorings with local constraints -- a survey
• Facial parity edge coloring of outerplane graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved bounds for some facially constrained colorings