WORM colorings of planar graphs
From MaRDI portal
Publication:521753
DOI10.7151/DMGT.1921zbMATH Open1359.05037OpenAlexW2521213992MaRDI QIDQ521753FDOQ521753
Authors: Július Czap, Juraj Valiska, Stanislav 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
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Some simplified NP-complete graph problems
- Every planar map is four colorable
- Graph colorings with local constraints -- a survey
- 3-consecutive C-colorings of graphs
- Vertex coloring without large polychromatic stars
- Colouring planar mixed hypergraphs
- On 1-improper 2-coloring of sparse graphs
- Nombre chromatique et plus longs chemins d'un graphe
- Worm colorings
- WORM colorings forbidding cycles or cliques
- Defective coloring revisited
- Trees in Polyhedral Graphs
- Acyclic colorings of planar graphs
- On planar mixed hypergraphs
- On the linear vertex-arboricity of a planar graph
- Title not available (Why is that?)
- Graphs with forbidden subgraphs
- A colourful path
- Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Colouring planar graphs with three colours and no large monochromatic components
- Title not available (Why is that?)
- Gaps in the chromatic spectrum of face-constrained plane graphs
- \(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)
