WORM colorings of planar graphs

DOI10.7151/DMGT.1921MaRDI QIDQ521753zbMATH OpenOpenAlexFDO

Authors Július Czap, Juraj Valiska, Stanislav Jendroľ

Publication date 12 April 2017

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• \(F\)-WORM colorings: results for 2-connected graphs
• WORM colorings forbidding cycles or cliques
• Colouring planar graphs
• On the total coloring of planar graphs.
• Complete colorings of planar graphs
• scientific article; zbMATH DE number 1347005
• Publication:4952682
• Coloring Powers of Planar Graphs
• Wegner's conjecture on 2-distance coloring for planar graphs
• Acyclic colorings of planar graphs

Cites work

• scientific article; zbMATH DE number 3547322 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• scientific article; zbMATH DE number 3276423 (Why is no real title available?)
• 3-consecutive C-colorings of graphs
• A colourful path
• Acyclic colorings of planar graphs
• Colouring planar graphs with three colours and no large monochromatic components
• Colouring planar mixed hypergraphs
• Defective coloring revisited
• Every planar map is four colorable
• Gaps in the chromatic spectrum of face-constrained plane graphs
• Graph colorings with local constraints -- a survey
• Graph theory
• Graphs with forbidden subgraphs
• Nombre chromatique et plus longs chemins d'un graphe
• On 1-improper 2-coloring of sparse graphs
• On planar mixed hypergraphs
• On the linear vertex-arboricity of a planar graph
• Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
• Some simplified NP-complete graph problems
• Splitting planar graphs of girth 6 into two linear forests with short paths
• Trees in Polyhedral Graphs
• Vertex coloring without large polychromatic stars
• WORM colorings forbidding cycles or cliques
• Worm colorings
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

Cited in

(7)

• Chromatic spectrum of \(K_s\)-WORM colorings of \(K_n\)
• Worm colorings
• Improved bounds for some facially constrained colorings
• \(F\)-WORM colorings: results for 2-connected graphs
• Colorings of plane graphs without long monochromatic facial paths
• WORM colorings forbidding cycles or cliques
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

This page was built for publication: WORM colorings of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521753)