Colorings of plane graphs without long monochromatic facial paths

DOI10.7151/dmgt.2319zbMath1459.05056OpenAlexW3019298974MaRDI QIDQ2656334

Július Czap, Igor Fabrici, Stanlislav Jendroľ

Publication date: 11 March 2021

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

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

zbMATH Keywords

plane graphvertex-coloringfacial path

Mathematics Subject Classification ID

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

Related Items

Improved bounds for some facially constrained colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 1-improper 2-coloring of sparse graphs
• Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
• WORM colorings of planar graphs
• 2-list-coloring planar graphs without monochromatic triangles
• Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
• Graphs with forbidden subgraphs
• Defective coloring revisited
• On the linear vertex-arboricity of a planar graph
• Every planar map is four colorable
• A new proof of the 6 color theorem
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
• Improper Choosability of Planar Graphs without 4-Cycles
• Acyclic colorings of planar graphs