WORM colorings of planar graphs

DOI10.7151/dmgt.1921zbMath1359.05037OpenAlexW2521213992MaRDI QIDQ521753

Július Czap, Juraj Valiska, Stanlislav Jendroľ

Publication date: 12 April 2017

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

Full work available at URL: https://doi.org/10.7151/dmgt.1921

zbMATH Keywords

plane graphrainbow pathfacial coloringmonochromatic pathWORM coloring

Mathematics Subject Classification ID

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

Related Items

Colorings of plane graphs without long monochromatic facial paths ⋮ \(F\)-WORM colorings: results for 2-connected graphs ⋮ Improved bounds for some facially constrained colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 1-improper 2-coloring of sparse graphs
• Vertex coloring without large polychromatic stars
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
• Some simplified NP-complete graph problems
• Colouring planar mixed hypergraphs
• Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
• Worm colorings
• Graphs with forbidden subgraphs
• 3-consecutive C-colorings of graphs
• Defective coloring revisited
• On the linear vertex-arboricity of a planar graph
• A colourful path
• Every planar map is four colorable
• Graph colorings with local constraints -- a survey
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
• Colouring Planar Graphs With Three Colours and No Large Monochromatic Components
• Trees in Polyhedral Graphs
• Nombre chromatique et plus longs chemins d'un graphe
• Acyclic colorings of planar graphs
• Gaps in the chromatic spectrum of face-constrained plane graphs
• On planar mixed hypergraphs